A First Order Nonmonotonic Extension of Constructive Logic

Certain extensions of Nelson's constructive logic N with strong negation have recently become important in arti.cial intelligence and nonmonotonic reasoning, since they yield a logical foundation for answer set programming (ASP). In this paper we look at some extensions of Nelson's .rst-order logic as a basis for de.ning nonmonotonic inference relations that underlie the answer set programming semantics. The extensions we consider are those based on 2-element, here-and-there Kripke frames. In particular, we prove completeness for .rst-order here-and-there logics, and their minimal strong negation extensions, for both constant and varying domains. We choose the constant domain version, which we denote by QNc5, as a basis for de.ning a .rst-order nonmonotonic extension called equilibrium logic. We establish several metatheoretic properties of QNc5, including Skolem forms and Herbrand theorems and Interpolation, and show that the .rst-oder version of equilibrium logic can be used as a foundation for answer set inference.

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

[2]  David Pearce,et al.  Simplifying Logic Programs Under Answer Set Semantics , 2004, ICLP.

[3]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[4]  David Pearce,et al.  Synonymus Theories in Answer Set Programming and Equilibrium Logic , 2004, ECAI.

[5]  Sabine Gornemann,et al.  A Logic Stronger Than Intuitionism , 1971, J. Symb. Log..

[6]  Dmitrij P. Skvortsov.  On Intermediate Predicate Logics of some Finite Kripke Frames, I. Levelwise Uniform Trees , 2004, Stud Logica.

[7]  Richard Routley,et al.  Semantical analyses of propositional systems of Fitch and Nelson , 1974 .

[8]  Ichiro Hasuo,et al.  Kripke Completeness of First-Order Constructive Logics with Strong Negation , 2003, Log. J. IGPL.

[9]  David Pearce,et al.  Uniform Equivalence for Equilibrium Logic and Logic Programs , 2004, LPNMR.

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

[11]  J. Jaspers.  Calculi for Constructive Communication , 1994 .

[12]  Richmond H. Thomason,et al.  A semantical study of constructible falsity , 1969 .

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

[14]  David Pearce,et al.  Answer Sets and Constructive Logic, II: Extended Logic Programs and Related Nonmonotonic Formalisms , 1993, LPNMR.

[15]  Dimiter Vakarelov,et al.  Notes on N-lattices and constructive logic with strong negation , 1977 .

[16]  Heinrich Wansing,et al.  The Logic of Information Structures , 1993, Lecture Notes in Computer Science.

[17]  D. Vakarelov,et al.  Lattices related to Post algebras and their applications to some logical systems , 1977 .

[18]  Gerd Wagner.  Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation , 1994 .

[19]  Yuri Gurevich,et al.  Intuitionistic logic with strong negation , 1977 .

[20]  Marcus Kracht,et al.  On Extensions of Intermediate Logics by Strong Negation , 1998, J. Philos. Log..

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

[22]  V. S. Subrahmanian,et al.  A firstdorder representation of stable models[1]A preliminary version of this paper has appeared inc Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’97), J. Dix, U. Furbach and A. Nerode, eds, LNCS 1265, Springer, 1997. , 1998 .

[23]  Christian G. Fermüller,et al.  Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving , 2001, LPAR.

[24]  David Pearce,et al.  From Here to There: Stable Negation in Logic Programming , 1999 .

[25]  Gerd Wagner,et al.  Logic Programming with Strong Negation , 1989, ELP.

[26]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

[27]  Lex Hendriks,et al.  Characterization of strongly equivalent logic programs in intermediate logics , 2002, Theory and Practice of Logic Programming.

[28]  Michael Gelfond,et al.  The USA-Advisor: A Case Study in Answer Set Planning , 2001, LPNMR.

[29]  Francesco Calimeri,et al.  Enhancing Disjunctive Logic Programming for Ontology Specification , 2003, APPIA-GULP-PRODE.

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

[31]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[32]  Valentin Goranko.  The Craig interpolation theorem for prepositional logics with strong negation , 1985, Stud Logica.