Prolog and ASP Inference under One Roof

Answer set programming ASP is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. The proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from prolog. Using prolog inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.

[1]  Miroslaw Truszczynski,et al.  Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving , 2012, PADL.

[2]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

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

[4]  Krzysztof R. Apt,et al.  Acyclic programs , 2009, New Generation Computing.

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

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

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

[8]  Hans Tompits,et al.  dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

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

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

[11]  Thomas Eiter,et al.  Pushing Efficient Evaluation of HEX Programs by Modular Decomposition , 2011, LPNMR.

[12]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

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

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

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

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

[17]  Mario Alviano,et al.  Dynamic Magic Sets and super-coherent answer set programs , 2011, AI Commun..

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

[19]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

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

[21]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

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

[23]  Martin Gebser,et al.  aspcud: A Linux Package Configuration Tool Based on Answer Set Programming , 2011, LoCoCo.

[24]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

[27]  Peter J. Stuckey,et al.  Lazy Model Expansion by Incremental Grounding , 2012, ICLP.

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

[29]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.