Fixpoint 3-Valued Semantics for Autoepistemic Logic

The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and define the semantics as its least fixpoint. The semantics is 3-valued in the sense that, for some formulas, the least fixpoint does not specify whether they are believed or not. We show that complete fixpoints of the derivation operator correspond to Moore's stable expansions. In the case of modal representations of logic programs our least fixpoint semantics expresses well-founded semantics or 3-valued Fitting-Kunen semantics (depending on the embedding used). We show that, computationally, our semantics is simpler than the semantics proposed by Moore (assuming that the polynomial hierarchy does not collapse).

[1]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[2]  Georg Gottlob,et al.  Translating default logic into standard autoepistemic logic , 1995, JACM.

[3]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[4]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[5]  Hector J. Levesque,et al.  All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..

[6]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[7]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[8]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[9]  Patrik Simons,et al.  Evaluating an Algorithm for Default Reasoning , 1995 .

[10]  Nicolas Bourbaki.  Elements of Mathematics: Theory of Sets , 1968 .

[11]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[12]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[13]  Ilkka Niemelä.  On the decidability and complexity of autoepistemic reasoning , 1992, Fundam. Informaticae.

[14]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[15]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[16]  G. Markowsky.  Chain-complete posets and directed sets with applications , 1976 .

[17]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[18]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[19]  Grigori Schwarz,et al.  Minimal model semantics for nonmonotonic modal logics , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[20]  Robert C. Moore.  Possible-World Semantics for Autoepistemic Logic , 1987, NMR.

[21]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[22]  Grigori Schwarz.  Autoepistemic Logic of Knowledge , 1991, LPNMR.

[23]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..