Ostrowski, Max
ASP modulo CSP: The clingcon system
Abstract
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.
BibTeX - Entry
@InProceedings{ostrowski:LIPIcs:2012:3646,
author = {Max Ostrowski},
title = {{ASP modulo CSP: The clingcon system}},
booktitle = {Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
pages = {458--463},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-43-9},
ISSN = {1868-8969},
year = {2012},
volume = {17},
editor = {Agostino Dovier and V{\'i}tor Santos Costa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3646},
URN = {urn:nbn:de:0030-drops-36465},
doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.458},
annote = {Keywords: Answer Set Programming, Constraint Programming}
}
|
Keywords: |
|
Answer Set Programming, Constraint Programming |
|
Seminar: |
|
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
|
|
Issue date: |
|
2012 |
|
Date of publication: |
|
27.07.2012 |