Clingcon: The Next Generation
Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten, Schaub

TL;DR
Clingcon 3 advances hybrid ASP-CP solving by integrating constraint propagation lazily into the ASP solver, improving performance and flexibility without requiring extensive modifications to existing tools.
Contribution
It introduces a lazy, integrated approach to combining ASP and CP in clingcon 3, enhancing performance and usability over previous black-box methods.
Findings
Significant performance improvements demonstrated.
Seamless integration with existing ASP tools.
Effective use of CP techniques within ASP solving.
Abstract
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp. No extension is needed for parsing and grounding clingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounder gringo. As a whole, clingcon 3 is thus an extension of the ASP system clingo 5, which itself relies on the grounder gringo and the solver clasp. The new approach of clingcon offers a seamless integration of CP propagation into ASP solving that benefits from the whole spectrum of clasp's reasoning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Constraint Satisfaction and Optimization
