A Logic for Non-Monotone Inductive Definitions

Well-known principles of induction include monotone induction and different sorts of nonmonotone induction such as inflationary induction, induction over well-founded sets and iterated induction. In this work, we define a logic formalizing induction over well-founded sets and monotone and iterated induction. Just as the principle of positive induction has been formalized in FO(LFP), and the principle of inflationary induction has been formalized in FO(IFP), this paper formalizes the principle of iterated induction in a new logic for Non-Monotone Inductive Definitions (ID-logic). The semantics of the logic is strongly influenced by the well-founded semantics of logic programming. Our main result concerns the modularity properties of inductive definitions in ID-logic. Specif

[1]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[2]  Li-Yan Yuan,et al.  Compiling Defeasible Inheritance Networks to General Logic Programs , 1999, Artif. Intell..

[3]  Danny De Schreye,et al.  Compositionality of Normal Open Logic Programs , 1997, J. Log. Program..

[4]  Eugenia Ternovska,et al.  Reducing Inductive Definitions to Propositional Satisfiability , 2005, ICLP.

[5]  Eugenia Ternovska,et al.  Inductive Definability and the Situation Calculus , 1998, Transactions and Change in Logic Databases.

[6]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[7]  Daniele Theseider Dupré,et al.  An Inductive Definition Approach to Ramifications , 1998, Electron. Trans. Artif. Intell..

[8]  Eugenia Ternovska,et al.  Automata Theory for Reasoning About Actions , 1999, IJCAI.

[9]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

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

[11]  Joost Vennekens,et al.  Splitting an operator: Algebraic modularity results for logics with fixpoint semantics , 2006, TOCL.

[12]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[13]  Marc Denecker,et al.  Extending Classical Logic with Inductive Definitions , 2000, Computational Logic.

[14]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[15]  Horst Luckhardt,et al.  Generalized inductive definitions , 1973 .

[16]  Marc Denecker,et al.  The Well-Founded Semantics Is the Principle of Inductive Definition , 1998, JELIA.

[17]  Eugenia Ternovska,et al.  A Logic of Non-monotone Inductive Definitions and Its Modularity Properties , 2004, LPNMR.

[18]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .

[19]  Marc Denecker,et al.  What's in a model? Epistemological analysis of Logic Programming , 2004, Answer Set Programming.

[20]  Juliana Freire,et al.  XSB: A System for Effciently Computing WFS , 1997, LPNMR.

[21]  Eugenia Ternovskaia,et al.  Inductive Definability and the Situation Calculus , 1996 .

[22]  S. Feferman.  Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis , 1970 .

[23]  Melvin Fitting,et al.  Fixpoint Semantics for Logic Programming a Survey , 2001, Theor. Comput. Sci..

[24]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

[25]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[26]  Victor W. Marek,et al.  Uniform semantic treatment of default and autoepistemic logics , 2000, Artif. Intell..

[27]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[28]  D. Warren,et al.  Xsb -a System for Eeciently Computing Well Founded Semantics , 1997 .

[29]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[30]  W. Buchholz.  Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies , 1981 .

[31]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

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

[33]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[34]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

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

[36]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[37]  Stephan Kreutzer,et al.  Will deflation lead to depletion? On non-monotone fixed point inductions , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[38]  Victor W. Marek,et al.  Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning , 2000 .

[39]  Raymond Reiter,et al.  Equality and Domain Closure in First-Order Databases , 1980, JACM.

[40]  Victor W. Marek,et al.  Logic programming revisited , 2001, ACM Trans. Comput. Log..

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

[42]  Bert Van Nuffelen,et al.  A-System: Problem Solving through Abduction , 2001, IJCAI.

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

[44]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

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

[46]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

[48]  K. COMPTON.  A Deductive System for Existential Least Fixpoint Logic , 1993, J. Log. Comput..

[49]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[50]  Han Reichgelt.  Knowledge representation - an AI perspective , 1991, Tutorial monographs in cognitive science.

[51]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[52]  Johan Wittocx,et al.  The IDP framework for declarative problem solving , 2006 .

[53]  Eugenia Ternovska,et al.  Inductive situation calculus , 2004, Artif. Intell..

[54]  P. Martin-Löf.  Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions , 1971 .

[55]  John S. Schlipf,et al.  Complexity and undecidability results for logic programming , 1995, Annals of Mathematics and Artificial Intelligence.

[56]  Yiannis N. Moschovakis.  On nonmonotone inductive definability , 1974 .

[57]  Anuj Dawar,et al.  Fixed point logics , 2002, Bull. Symb. Log..

[58]  Hector J. Levesque,et al.  Competence in Knowledge Representation , 1982, AAAI.

[59]  Eugenia Ternovskaia,et al.  Causality via Inductive Deenitions , 2007 .

[60]  Stephen J. Garland.  Review: C. Spector, Inductively Defined Sets of Natural Numbers , 1969 .

[61]  Wolfram Pohlers.  Proof Theory: An Introduction , 1990 .

[62]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[63]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[64]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[65]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[66]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[67]  Jack Minker,et al.  Logic-Based Artificial Intelligence , 2000 .

[68]  David G. Mitchell,et al.  A Framework for Representing and Solving NP Search Problems , 2005, AAAI.