Author:
OSTROWSKI MAX,SCHAUB TORSTEN
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference32 articles.
1. Lemma Learning in SMT on Linear Constraints
2. Schulte C. , Tack G. and Lagerkvist M. 2012. Modeling. In Modeling and Programming with Gecode, Schulte C. , Tack G. , and Lagerkvist M. . Corresponds to Gecode 3.7.2.
3. Solving SAT and SAT Modulo Theories
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献