• search hit 12 of 1
Back to Result List

ASP modulo CSP The clingcon system

  • 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.

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Max OstrowskiGND, Torsten H. SchaubORCiDGND
DOI:https://doi.org/10.1017/S1471068412000142
ISSN:1471-0684
Title of parent work (English):Theory and practice of logic programming
Publisher:Cambridge Univ. Press
Place of publishing:New York
Publication type:Article
Language:English
Year of first publication:2012
Publication year:2012
Release date:2017/03/26
Volume:12
Number of pages:19
First page:485
Last Page:503
Funding institution:German Science Foundation (DFG) [SCHA 550/8-2, SCHA 550/10-1 AOBJ: 593494]
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
Peer review:Referiert
Institution name at the time of the publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik
External remark:Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 579
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.