Autoepistemic equilibrium logic and epistemic specifications

Abstract Epistemic specifications extend disjunctive answer-set programs by an epistemic modal operator that may occur in the body of rules. Their semantics is in terms of world views, which are sets of answer sets, and the idea is that the epistemic modal operator quantifies over these answer sets. Several such semantics were proposed in the literature. We here propose a new semantics that is based on the logic of here-and-there: we add epistemic modal operators to its language and define epistemic here-and-there models. We then successively define epistemic equilibrium models and autoepistemic equilibrium models. The former are obtained from epistemic here-and-there models in exactly the same way as Pearce's equilibrium models are obtained from here-and-there models, viz. by minimising truth; they provide an epistemic extension of equilibrium logic. The latter are obtained from the former by maximising the set of epistemic possibilities, and they provide a new semantics for Gelfond's epistemic specifications. For both semantics we establish a strong equivalence result: we characterise strong equivalence of two epistemic programs by means of logical equivalence in epistemic here-and-there logic. We finally compare our approach to the existing semantics of epistemic specifications and discuss which formalisms provide more intuitive results by pointing out some formal properties a semantics proposal should satisfy.

[1]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[2]  Luis Fariñas del Cerro,et al.  Capturing equilibrium models in modal logic , 2014, J. Appl. Log..

[3]  Fabio Massacci,et al.  Verifying security protocols as planning in logic programming , 2001, ACM Trans. Comput. Log..

[4]  Jorge Fandinno,et al.  Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting , 2019, Theory and Practice of Logic Programming.

[5]  Thomas Eiter,et al.  Evaluating epistemic negation in answer set programming , 2016, Artif. Intell..

[6]  Patrick T. Kahl Refining the semantics for epistemic logic programs , 2014 .

[7]  Michael Morak,et al.  Epistemic Logic Programs: A Different World View , 2019, ICLP Technical Communications.

[8]  G. Servi On modal logic with an intuitionistic base , 1977 .

[9]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[10]  Michael Gelfond New Semantics for Epistemic Specifications , 2011, LPNMR.

[11]  David Pearce,et al.  Equilibrium logic , 2006, Annals of Mathematics and Artificial Intelligence.

[12]  Patrick Thor Kahl,et al.  Epistemic Logic Programs with World View Constraints. , 2018 .

[13]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[14]  Luis Fariñas del Cerro,et al.  Founded World Views with Autoepistemic Equilibrium Logic , 2019, LPNMR.

[15]  Pedro Cabalar,et al.  Temporal Equilibrium Logic with past operators , 2017, J. Appl. Non Class. Logics.

[16]  Pedro Cabalar,et al.  Temporal equilibrium logic: a survey , 2013, J. Appl. Non Class. Logics.

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

[18]  Ezgi Iraz Su Epistemic Answer Set Programming , 2019, JELIA.

[19]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .

[20]  Michael Gelfond,et al.  Logic programming and reasoning with incomplete information , 1994, Annals of Mathematics and Artificial Intelligence.

[21]  Ezgi Iraz Su Strongly Equivalent Epistemic Answer Set Programs , 2019, AI*IA.

[22]  A. Heyting Die formalen Regeln der intuitionistischen Logik , 1930 .

[23]  Torsten Schaub,et al.  Temporal Answer Set Programming on Finite Traces , 2018, Theory and Practice of Logic Programming.

[24]  Michael Gelfond,et al.  Strong Introspection , 1991, AAAI.

[25]  Stefania Costantini About epistemic negation and world views in Epistemic Logic Programs , 2019, Theory Pract. Log. Program..

[26]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[27]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[28]  Philippe Balbiani,et al.  Temporal Here and There , 2016, JELIA.

[29]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[30]  Luis Fariñas del Cerro,et al.  Combining Equilibrium Logic and Dynamic Logic , 2013, LPNMR.

[31]  Martín Diéguez,et al.  Temporal Answer Set Programming , 2020, ICLP.

[32]  Valeria de Paiva,et al.  On an Intuitionistic Modal Logic , 2000, Stud Logica.

[33]  Fabio Massacci,et al.  An executable specification language for planning attacks to security protocols , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[34]  Michael Gelfond,et al.  The language of epistemic specifications (refined) including a prototype solver , 2020, J. Log. Comput..

[35]  Tran Cao Son,et al.  A parallel memory-efficient epistemic logic program solver: harder, better, faster , 2019, Annals of Mathematics and Artificial Intelligence.

[36]  Luis Fariñas del Cerro,et al.  On the Properties of Atom Definability and Well-Supportedness in Logic Programming , 2017, EPIA.

[37]  Thomas Eiter,et al.  Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract) , 2017, IJCAI.

[38]  Torsten Schaub,et al.  Introducing Temporal Stable Models for Linear Dynamic Logic , 2018, KR.

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

[40]  Luis Fariñas del Cerro,et al.  Epistemic Equilibrium Logic , 2015, IJCAI.

[41]  Ezgi Iraz Su A Monotonic View on Reflexive Autoepistemic Reasoning , 2017, LPNMR.

[42]  Tran Cao Son,et al.  On Computing World Views of Epistemic Logic Programs , 2017, IJCAI.

[43]  Fabio Massacci,et al.  Planning Attacks to Security Protocols: Case Studies in Logic Programming , 2002, Computational Logic: Logic Programming and Beyond.

[44]  Luis Fariñas del Cerro,et al.  Splitting Epistemic Logic Programs , 2018, LPNMR.

[45]  Yan Zhang,et al.  Epistemic Specifications and Conformant Planning , 2017, AAAI Workshops.

[46]  Ezgi Iraz Su An S4F-related Monotonic Modal Logic , 2017, ICTCS/CILC.

[47]  Miroslaw Truszczynski Revisiting Epistemic Specifications , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.

[48]  Jianhua Chen,et al.  The Generalized Logic of only Knowing (GOL) That Covers the Notion of Epistemic Specifications , 1994, J. Log. Comput..

[49]  Yan Zhang,et al.  Nested Epistemic Logic Programs , 2005, LPNMR.