Title: Predicate introduction under stable and well-founded semantics
Authors: Wittocx, Johan ×
Vennekens, Joost
Mariƫn, Maarten
Denecker, Marc
Bruynooghe, Maurice #
Issue Date: 2006
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:4079 pages:242-256
Conference: International Conference on Logic Programming, ICLP edition:22 location:Seattle, Washington, USA date:August 17-10, 2006
Abstract: This paper studies the transformation of "predicate introduction": replacing a complex formula in an existing logic program by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certain inference programs or theorems, e.g., through the elimination of universal quantifiers. In this paper, we study when predicate introduction is equivalence preserving under the stable and well-founded semantics. We do this in the algebraic framework of "approximation theory"; this is a fixpoint theory for non-monotone operators that generalizes all main semantics of various non-monotone logics, including Logic Programming, Default Logic and Autoepistemic Logic. We prove an abstract, algebraic equivalence result and then instantiate this abstract theorem to Logic Programming under the stable and well-founded semantics.
ISBN: 3-540-36635-0
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campus De Nayer Sint-Katelijne-Waver
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
42192.pdf Published 231KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science