Theory Solving made easy with Clingo 5 ( Extended Version ∗ )

Answer Set Programming (ASP) is a model, ground, and solve paradigm. The integration of applicationor theory-specific reasoning into ASP systems thus impacts on many if not all elements of its workflow, viz. input language, grounding, intermediate language, solving, and output format. We address this challenge with the fifth generation of the ASP system clingo and its grounding and solving components by equipping them with well-defined generic interfaces facilitating the manifold integration efforts. On the grounder’s side, we introduce a generic way of specifying language extensions and propose an intermediate format accommodating their ground representation. At the solver end, this is accompanied by high-level interfaces easing the integration of theory propagators dealing with these extensions.

[1]  Vladimir Lifschitz,et al.  Answer Set Programming , 2019 .

[2]  Torsten Schaub,et al.  An ASP Semantics for Default Reasoning with Constraints , 2016, IJCAI.

[3]  Martin Gebser,et al.  Domain-Specific Heuristics in Answer Set Programming , 2013, AAAI.

[4]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[5]  Editors , 2003 .

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

[7]  Martin Gebser,et al.  Theory Solving Made Easy with Clingo 5 , 2016, ICLP.

[8]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[9]  Martin Gebser,et al.  Answer Set Programming Modulo Acyclicity , 2015, Fundam. Informaticae.

[10]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[11]  Torsten Schaub,et al.  Clingcon: The next generation* , 2017, Theory and Practice of Logic Programming.

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

[13]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[14]  Martin Gebser,et al.  Clingo = ASP + Control: Preliminary Report , 2014, ArXiv.

[15]  Thomas Eiter,et al.  Conflict-driven ASP solving with external sources , 2012, Theory and Practice of Logic Programming.

[16]  I. Niemelä,et al.  Tight Integration of Non-Ground Answer Set Programming and Satisfiability Modulo Theories , 2011 .

[17]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[18]  Yuliya Lierler,et al.  What is answer set programming to propositional satisfiability , 2017, Constraints.

[19]  Toby Walsh,et al.  Answer Set Solving with Lazy Nogood Generation , 2012, ICLP.

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

[21]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[22]  Thomas Eiter,et al.  Under consideration for publication in Theory and Practice of Logic Programming 1 Finding Similar / Diverse Solutions in Answer Set Programming , 2003 .