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

Full description

Saved in:
Bibliographic Details
Published inTheory and practice of logic programming Vol. 12; no. 4-5; pp. 485 - 503
Main Authors OSTROWSKI, MAX, SCHAUB, TORSTEN
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.07.2012
Subjects
Boolean algebra
Computer models
Learning
Logic programming
Mathematical models
Programming
Programming languages
Regular Papers
Solvers
Syntax
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068412000142