Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/splitting-an-operator-algebraic-modularity-results-for-logics-with-2UxY7KvhJK
References (34)
-
M. Fitting (1985)
A Kripke-Kleene Semantics for Logic ProgramsJ. Log. Program., 2
-
Sofie Verbaeten, M. Denecker, D. Schreye (1997)
Compositionality of Normal Open Logic ProgramsJ. Log. Program., 42
-
M. Denecker, V. Marek, M. Truszczynski (2000)
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning -
Thomas Eiter, G. Gottlob, H. Mannila (1997)
Disjunctive datalogACM Trans. Database Syst., 22
-
M. Denecker, V. Marek, M. Truszczynski (2000)
Uniform semantic treatment of default and autoepistemic logicsArtif. Intell., 143
-
V. Lifschitz, H. Turner (1994)
Splitting a Logic Program -
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.) -
Teodor Przymusinski (1989)
Every logic program has a natural stratification and an iterated least fixed point model -
M. Denecker (2000)
Extending Classical Logic with Inductive DefinitionsArXiv, cs.LO/0003019
-
M. Gelfond (1987)
On Stratified Autoepistemic Theories -
Joost Vennekens, David Gilis, M. Denecker (2004)
Logic Programming, 3132
-
Joost Vennekens, David Gilis, M. Denecker (2004)
Splitting an Operator -
A. Gelder, K. Ross, J. Schlipf (1991)
The well-founded semantics for general logic programsJ. ACM, 38
-
A. Tarski (1955)
A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONSPacific Journal of Mathematics, 5
-
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
-
Joost Vennekens, David Gilis, M. Denecker (2004)
Splitting an operator: an algebraic modularity result and its application to auto-epistemic logic -
M. Gelfond, H. Przymusinska (1992)
On consistency and completeness of autoepistemic theoriesFundam. Informaticae, 16
-
K. Apt, H. Blair, A. Walker (1988)
Towards a Theory of Declarative Knowledge -
I. Niemelä, J. Rintanen (1992)
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning -
V. Marek, M. Truszczynski (1989)
Stable Semantics for Logic Programs and Default Theories -
M. Fitting (1991)
Bilattices and the Semantics of Logic ProgrammingJ. Log. Program., 11
-
David Etherington (1988)
Reasoning With Incomplete Information -
K. Konolige (1987)
On the Relation Between Default and Autoepistemic LogicArtif. Intell., 35
-
J. Meyer, W. Hoek (1995)
Epistemic logic for AI and computer science, 41
-
Selim Erdogan, V. Lifschitz (2003)
Definitions in Answer Set Programming: (Extended Abstract) -
M. Denecker, V. Marek, M. Truszczynski (1998)
Fixpoint 3-Valued Semantics for Autoepistemic LogicArXiv, cs.LO/9901003
-
J. Minker (2000)
Logic-Based Artificial Intelligence -
M. Denecker, E. Ternovska (2004)
A Logic of Non-monotone Inductive Definitions and Its Modularity Properties -
Robert Moore (1987)
Possible-World Semantics for Autoepistemic Logic -
Nikolay Pelov, M. Truszczynski (2004)
Semantics of disjunctive programs with monotone aggregates - an operator-based approach -
J. Lloyd (1984)
Foundations of Logic Programming -
H. Turner (1996)
Splitting a Default Theory -
N. Leone, Francesco Scarcello (1995)
Declarative and Fixpoint Characterizations of Disjunctive Stable Models -
M. Ginsberg (1988)
Multivalued logics: a uniform approach to reasoning in artificial intelligenceComputational Intelligence, 4
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2006 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1183278.1183284
- Publisher site
- See Article on Publisher Site
Abstract
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, that is, 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 nonmonotonic formalisms, such as auto-epistemic logic and default logic. In this work, we present a general, algebraic splitting theory for logics with 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 existing results for logic programming, auto-epistemic logic and default logic.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2006