Infinitary equilibrium logic and strongly equivalent logic programs

Abstract Strong equivalence is an important concept in the theory of answer set programming. Informally speaking, two sets of rules are strongly equivalent if they have the same meaning in any context. Equilibrium logic was used to prove that sets of rules expressed as propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend this line of work to formulas with infinitely long conjunctions and disjunctions, show that the infinitary logic of here-and-there characterizes strong equivalence of infinitary formulas, and give an axiomatization of that logic. This is useful because of the relationship between infinitary formulas and logic programs with local variables.

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

[2]  Vladimir Lifschitz,et al.  Proving infinitary formulas , 2016, Theory and Practice of Logic Programming.

[3]  Ivo Thomas.  Finite limitations on Dummet's LC , 1962, Notre Dame J. Formal Log..

[4]  Michael Gelfond,et al.  Answer Sets , 2008, Handbook of Knowledge Representation.

[5]  Miroslaw Truszczynski,et al.  Connecting First-Order ASP and the Logic FO(ID) through Reducts , 2012, Correct Reasoning.

[6]  Erwin Engeler,et al.  Languages with expressions of infinite length , 1966 .

[7]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[8]  Mark E. Nadel.  Infinitary intuitionistic logic from a classical point of view , 1978 .

[9]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[10]  T. Hosoi.  The axiomatization of the intermediate propositional systems $S_2$ of Godel , 1966 .

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

[12]  T. Umezawa.  On intermediate many-valued logics , 1959 .

[13]  David Pearce,et al.  Infinitary Equilibrium Logic and Strong Equivalence , 2015, LPNMR.

[14]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

[15]  Steven Givant,et al.  Introduction to Boolean Algebras , 2008 .

[16]  L. Kalmár.  Zurückführung des Entscheidungsproblems auf den Fall von Formeln mit einer einzigen, binären, Funktionsvariablen , 1937 .

[17]  Alfred Tarski,et al.  The Sentential Calculus with Infinitely Long Expressions , 1958 .

[18]  Martin Gebser,et al.  Abstract gringo , 2015, Theory Pract. Log. Program..

[19]  J. R. Buzeman.  Introduction To Boolean Algebras , 1961 .

[20]  Miroslaw Truszczynski,et al.  On equivalence of infinitary formulas under the stable model semantics , 2014, Theory and Practice of Logic Programming.

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

[22]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

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

[24]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[25]  Pedro Cabalar,et al.  Propositional theories are strongly equivalent to logic programs , 2007, Theory Pract. Log. Program..

[26]  David Pearce,et al.  Correct Reasoning: essays on logic-based AI in honor of Vladimir Lifschitz , 2012 .