The IDP system: A model expansion system for an extension of classical logic

The model expansion (MX) search problem consists of finding models of a given theory T that expand a given finite interpretation. Model expansion in classical first-order logic (FO) has been proposed as the basis for an Answer Set Programming-like declarative programming framework for solving NP problems. In this paper, we present idp, a system for solving MX problems that integrates technology from ASP and SAT. Its strength lies both in its rich input language and its efficiency. idp is the first model expansion system that can handle full FO, but its language extends FO with many other primitives such as inductive definitions, aggregates, quantifiers with numerical constraints, order-sorted types, arithmetic, partial functions, etc. We show that this allows for a natural, compact representation of many interesting search problems. Despite the generality of its language, our experiments show that the idp system belongs to the most efficient ASP and MX systems.

[1]  Gerald Pfeifer,et al.  System Description: DLV , 2001, LPNMR.

[2]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[3]  Johan Wittocx,et al.  Integrating Inductive Definitions in SAT , 2007, LPAR.

[4]  Johan Wittocx,et al.  GidL: A grounder for FO+ , 2008, Non-Monotonic Reasoning.

[5]  Johan Wittocx,et al.  MidL: A SAT(ID) solver , 2007 .

[6]  Eugenia Ternovska,et al.  A Logic for Non-Monotone Inductive Definitions , 2005, ArXiv.

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

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

[9]  Miroslaw Truszczynski,et al.  Predicate-calculus-based logics for modeling and solving search problems , 2006, TOCL.

[10]  Miroslaw Truszczynski,et al.  The First Answer Set Programming System Competition , 2007, LPNMR.

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

[12]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

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

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

[15]  Maurice Bruynooghe,et al.  SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions , 2008, SAT.

[16]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

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

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

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