TY  - GEN
A1  - Ostrowski, Max
A1  - Schaub, Torsten H.
T1  - ASP modulo CSP
T2  - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
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.
T3  - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 579 
KW  - answer set
KW  - constraints
KW  - logic
KW  - SMT
Y1  - 2019
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41390
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus4-413908
SN  - 1866-8372
IS  - 579
ER  -