Revisiting quantification in autoepistemic logic

In this article, we introduce first-order autoepistemic logic. Our definition is semantical and is based on the intuition similar to that lying behind the definition of first-order default logic. Thus, our definition of first-order autoepistemic logic well complies with that of first-order default logic and circumscription, providing a substantial evidence for its acceptance.

[1]  Victor W. Marek,et al.  Relating Autoepistemic and Default Logics , 1989, KR.

[2]  Max J. Cresswell,et al.  A companion to modal logic , 1984 .

[3]  Raymond Reiter On Closed World Data Bases , 1977, Logic and Data Bases.

[4]  Tomi Janhunen Representing Autoepistemic Introspection in Terms of Default Rules , 1996, ECAI.

[5]  J. Horty Nonmonotonic Logic , 2001 .

[6]  Michael Kaminski,et al.  A Note on the Stable Model Semantics for Logic Programs. (Research Note) , 1997, Artif. Intell..

[7]  Gerhard Lakemeyer On perfect introspection with Quantifying-in , 1992, Fundam. Informaticae.

[8]  Michael Kaminski,et al.  First-order Non-monotonic Modal Logics , 2000, Fundam. Informaticae.

[9]  Ilkka Niemelä Autoepistemic Predicate Logic , 1988, ECAI.

[10]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[11]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[12]  Grigori F. Shvarts Autoepistemic Modal Logics , 1990, TARK.

[13]  Tomi Janhunen On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription , 1998, JELIA.

[14]  Kurt Konolige,et al.  Quantification in autoepistemic logic , 1991, Fundam. Informaticae.

[15]  Vladimir Lifschitz,et al.  On Open Defaults , 1990 .

[16]  Johann A. Makowsky,et al.  Extensions for Open Default Theories via the Domain Closure Assumption , 1996, J. Log. Comput..

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

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

[19]  Tomi Janhunen On the intertranslatability of non‐monotonic logics , 2004, Annals of Mathematics and Artificial Intelligence.

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

[21]  Michael Kaminski,et al.  The elimination of de re formulas , 1997, J. Philos. Log..

[22]  Michael Kaminski A Comparative Study of Open Default Theories , 1995, Artif. Intell..

[23]  Michael Kaminski Open Default Theories over Closed Domains , 1999, ESCQARU.

[24]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

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

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

[27]  Kurt Konolige,et al.  Autoepistemic logic , 1994 .

[28]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[29]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

[30]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[31]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

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

[33]  V. Wiktor Marek,et al.  Nonmonotonic Logic , 1993, Artificial Intelligence.

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