Autoepistemic Logic of Knowledge and Beliefs

Abstract In recent years, various formalizations of nonmonotonic reasoning and different semantics for normal and disjunctive logic programs have been proposed, including autoepistemic logic, circumscription, CWA, GCWA, ECWA , epistemic specifications, stable, well-founded, stationary and static semantics of normal and disjunctive logic programs. In this paper we introduce a simple nonmonotonic knowledge representation framework which isomorphically contains all of the above-mentioned nonmonotonic formalisms and semantics as special cases and yet is significantly more expressive than each one of these formalisms considered individually. The new formalism, called the Autoepistemic Logic of Knowledge and Beliefs, AELB , is obtained by augmenting Moore's autoepistemic logic, AEL , already employing the knowledge operator , L , with an additional belief operator , B . As a result, we are able to reason not only about formulae F which are known to be true (i.e., those for which L F holds) but also about those which are only believed to be true (i.e., those for which B F holds). The proposed logic constitutes a powerful new formalism which can serve as a unifying frame-work for several major nonmonotonic formalisms. It allows us to better understand mutual relationships existing between different formalisms and semantics and enables us to provide them with simpler and more natural definitions. It also naturally leads to new, even more expressive, flexible and modular formalizations and semantics.

[1]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

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

[3]  Jack Minker Foundations of deductive databases and logic programming , 1988 .

[4]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[5]  A RossKenneth,et al.  The well-founded semantics for general logic programs , 1991 .

[6]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[7]  Teodor C. Przymusinski Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..

[8]  Jürgen Dix,et al.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995, ICLP.

[9]  Wiktor Marek,et al.  STABLE THEORIES IN AUTOEPISTEMIC LOGIC , 1989 .

[10]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[11]  Teodor C. Przymusinski Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework , 1994, NMELP.

[12]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[13]  José Júlio Alferes,et al.  On Logic Program Semantics with Two Kinds of Negation , 1992, JICSLP.

[14]  Teodor C. Przymusinski Autoepistemic Logics of Closed Beliefs and Logic Programming , 1991, LPNMR.

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

[16]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[17]  Teodor C. Przymusinski,et al.  Semantic Issues in Deductive Databases and Logic Programs , 1990 .

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

[19]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[20]  Vladimir Lifschitz Minimal Belief and Negation as Failure , 1994, Artif. Intell..

[21]  David S. Touretzky,et al.  A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..

[22]  José Júlio Alferes,et al.  Belief Revision in Non-Monotonic Reasoning and Logic Programming , 1996, Fundam. Informaticae.

[23]  Teodor C. Przymusinski On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

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

[25]  José Júlio Alferes,et al.  Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming , 1996, JELIA.