• search hit 58 of 590
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

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Max OstrowskiGND, Torsten SchaubORCiDGND
DOI:https://doi.org/10.1017/S1471068412000142
ISSN:1471-0684 (print)
Parent Title (English):Theory and practice of logic programming
Publisher:Cambridge Univ. Press
Place of publication:New York
Document Type:Article
Language:English
Year of first Publication:2012
Year of Completion:2012
Release Date:2017/03/26
Volume:12
Pagenumber:19
First Page:485
Last Page:503
Funder: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 publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik
Notes extern:Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 579