2026-08-05T23:45:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3646 2024-03-06T10:34:29Z ddc:004 open_access

ASP modulo CSP: The clingcon system Ostrowski, Max Answer Set Programming Constraint Programming Answer Set Programming (ASP) 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). My research shall contribute to bridging the gap between Boolean and Non-Boolean reasoning, in order to bring out the best of both worlds. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Max Ostrowski 2012 Is Part Of LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2012.458 urn:nbn:de:0030-drops-36465 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.458 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode