TY  - JOUR
A1  - Ostrowski, Max
A1  - Schaub, Torsten H.
T1  - ASP modulo CSP The clingcon system
T2  - Theory and practice of logic programming
N2  - We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.
Y1  - 2012
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/35775
SN  - 1471-0684
VL  - 12
SP  - 485
EP  - 503
PB  - Cambridge Univ. Press
CY  - New York
ER  -