FO(FD): Extending classical logic with rule-based fixpoint definitions

We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to difference logic and then using solvers for difference logic. These reductions are evaluated in the computation of models for FO(FD) theories representing fairness conditions and we provide potential applications of FO(FD).

[1]  Julian C. Bradfield,et al.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

[2]  Ilkka Niemelä,et al.  The Smodels System , 2001, LPNMR.

[3]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

[5]  Johan Wittocx,et al.  Grounding with Bounds , 2008, AAAI.

[6]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[7]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[8]  Gopal Gupta,et al.  Coinductive Logic Programming and Its Applications , 2007, ICLP.

[9]  Oliver Friedmann,et al.  Solving Parity Games in Practice , 2009, ATVA.

[10]  Lawrence S. Moss,et al.  Vicious circles - on the mathematics of non-wellfounded phenomena , 1996, CSLI lecture notes series.

[11]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[12]  Dov M. Gabbay,et al.  What Is Negation as Failure? , 2012, Logic Programs, Norms and Action.

[13]  C. R. Ramakrishnan,et al.  Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract) , 1998, TACAS.

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

[15]  Ilkka Niemelä,et al.  Solving Alternating Boolean Equation Systems in Answer Set Programming , 2004, INAP/WLP.

[16]  Albert Oliveras,et al.  DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic , 2005, CAV.

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

[18]  Ilkka Niemelä,et al.  Computing Stable Models via Reductions to Difference Logic , 2009, LPNMR.

[19]  Ilkka Niemelä,et al.  Stable models and difference logic , 2008, Annals of Mathematics and Artificial Intelligence.

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

[21]  Oded Maler,et al.  Fast and Flexible Difference Constraint Propagation for DPLL(T) , 2006, SAT.

[22]  A. Slisenko.  Studies in constructive mathematics and mathematical logic , 1969 .

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

[24]  Maurice Bruynooghe,et al.  FO(ID) as an extension of DL with rules , 2008, Annals of Mathematics and Artificial Intelligence.

[25]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[26]  David Baelde,et al.  Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.

[27]  Eugenia Ternovska,et al.  A logic of nonmonotone inductive definitions , 2008, TOCL.