ASP modulo CSP: The clingcon system

Technical Communications of the 28th International Conference on Logic Programming

Max Ostrowski

Others  :  http://drops.dagstuhl.de/opus/volltexte/2012/3646/pdf/44.pdf
PID  :  43136

来源: CEUR

【 摘 要 】

Answer Set Programming (ASP; [1]) has become a prime paradigm for declarative problem solving due to its combination of an easy yet expressive modeling language with high-performance Boolean constraint solving technology. However, certain applications are more naturally modeled by mixing Boolean with non-Boolean constructs, for instance, accounting for resources, fine timings, or functions over finite domains. The challenge lies in combining the elaborated solving capacities of ASP, like backjumping and conflict-driven learning, with advanced techniques from the area of constraint programming (CP). I therefore developed the solver clingcon, which follows the approach of modern Satisfiability Modulo Theories (SMT; [2, Chapter 26]). My research shall contribute to bridging the gap between Boolean and Non-Boolean reasoning, in order to bring out the best of both worlds.1998 ACM Subject Classification D.1.6. Logic Programming, I.2.3 Deduction and Theoremproving/Logic programming, D.3.2 Language Classifications/Constraint and logic languages