Title: Splitting an operator - An algebraic modularity result and its application to logic programming
Authors: Vennekens, Joost ×
Gilis, David
Denecker, Marc #
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3132 pages:195-209
Conference: International conference on logic programming (ICLP) edition:20 location:Saint-Malo, France date:6-10 September 2004
Abstract: It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and default logic. In this work, we present a general, algebraic splitting theory for programs/theories under a fixpoint semantics. Together with the framework of approximation theory, a general fixpoint theory for arbitrary operators, this gives us a uniform and powerful way of deriving splitting results for each logic with a fixpoint semantics. We demonstrate the usefulness of these results, by generalizing Lifschitz and Turner's splitting theorem to other semantics for (non-disjunctive) logic programs.
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 Description Status SizeFormat
41200.pdf Published 224KbAdobe PDFView/Open


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

© Web of science