Relating constraint answer set programming languages and algorithms

Recently a logic programming language AC was proposed by Mellarkod et al. [1] to integrate answer set programming and constraint logic programming. Soon after that, a clingcon language integrating answer set programming and finite domain constraints, as well as an ezcsp language integrating answer set programming and constraint logic programming were introduced. The development of these languages and systems constitutes the appearance of a new AI subarea called constraint answer set programming. All these languages have something in common. In particular, they aim at developing new efficient inference algorithms that combine traditional answer set programming procedures and other methods in constraint programming. Yet, the exact relation between the constraint answer set programming languages and the underlying systems is not well understood. In this paper we address this issue by formally stating the precise relation between several constraint answer set programming languages - AC, clingcon, ezcsp - as well as the underlying systems.

[1]  Ilkka Niemelä,et al.  Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009) , 2009 .

[2]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

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

[4]  Joohyung Lee,et al.  Symmetric Splitting in the General Theory of Stable Models , 2009, IJCAI.

[5]  Yuliya Lierler,et al.  Abstract Answer Set Solvers , 2008, ICLP.

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

[7]  Martin Gebser,et al.  Constraint Answer Set Solving , 2009, ICLP.

[8]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[9]  Thomas Eiter,et al.  Combining Nonmonotonic Knowledge Bases with External Sources , 2009, FroCoS.

[10]  Yuliya Lierler,et al.  A transition system for AC language algorithms , 2011 .

[11]  Enrico Pontelli,et al.  Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP , 2004, ICLP.

[12]  Yuliya Lierler,et al.  On the Relation of Constraint Answer Set Programming Languages and Algorithms , 2012, AAAI.

[13]  Yuliya Lierler,et al.  Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary , 2013, ArXiv.

[14]  Yuliya Lierler,et al.  Abstract answer set solvers with backjumping and learning , 2010, Theory and Practice of Logic Programming.

[15]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[16]  I. Niemelä,et al.  Extending the Smodels system with cardinality and weight constraints , 2001 .

[17]  Joohyung Lee,et al.  A Model-Theoretic Counterpart of Loop Formulas , 2005, IJCAI.

[18]  Vladimir Lifschitz,et al.  Definitions in Answer Set Programming: (Extended Abstract) , 2003, ICLP.

[19]  Toby Walsh,et al.  Translation-Based Constraint Answer Set Solving , 2011, IJCAI.

[20]  Michael Gelfond,et al.  Towards an Integration of Answer Set and Constraint Solving , 2005, ICLP.

[21]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

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

[23]  Peter J. Stuckey,et al.  Efficient constraint propagation engines , 2006, TOPL.

[24]  Torsten Schaub,et al.  ASP modulo CSP: The clingcon system , 2012, Theory and Practice of Logic Programming.

[25]  Yuliya Lierler,et al.  Prolog and ASP Inference under One Roof , 2013, LPNMR.

[26]  Michael Gelfond,et al.  Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.

[27]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

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

[29]  Toby Walsh,et al.  A translational approach to constraint answer set solving , 2010, Theory Pract. Log. Program..

[30]  Ilkka Niemelä,et al.  Answer Set Programming via Mixed Integer Programming , 2012, KR.

[31]  Thomas Eiter,et al.  Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems , 2007, AAAI.

[32]  Johan Wittocx,et al.  The IDP system: A model expansion system for an extension of classical logic , 2008 .

[33]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[34]  Vladimir Lifschitz,et al.  Weight constraints as nested expressions , 2003, Theory and Practice of Logic Programming.

[35]  Miroslaw Truszczynski,et al.  Transition systems for model generators—A unifying approach , 2011, Theory and Practice of Logic Programming.

[36]  Marcello Balduccini,et al.  Representing Constraint Satisfaction Problems in Answer Set Programming , 2022 .

[37]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[39]  Patrik Simons,et al.  Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.