\textit{clingcon}: the next generation
From MaRDI portal
Publication:4593092
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 modes, including for instance multi-shot solving and advanced optimization techniques. This is accomplished by a lazy approach that unfolds the representation of constraints and adds it to that of the logic program only when needed. Although the unfolding is usually dictated by the constraint propagators during solving, it can already be partially (or even totally) done during preprocessing. Moreover, clingcon's constraint preprocessing and propagation incorporate several well established CP techniques that greatly improve its performance. We demonstrate this via an extensive empirical evaluation contrasting, first, the various techniques in the context of CSP solving and, second, the new clingcon system with other hybrid ASP systems. Under consideration in Theory and Practice of Logic Programming (TPLP)
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A SAT-based method for solving the two-dimensional strip packing problem
- A translational approach to constraint answer set solving
- Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
- Answer set solving with lazy nogood generation
- ASP modulo CSP: the clingcon system
- aspartame: solving constraint satisfaction problems with answer set programming
- Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
- Compiling finite linear CSP into SAT
- Conflict-driven ASP solving with external sources
- Constraint Answer Set Solving
- Extending and implementing the stable model semantics
- GRASP: a search algorithm for propositional satisfiability
- Handbook of constraint programming.
- scientific article; zbMATH DE number 6677438 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Integrating answer set programming and constraint logic programming
- Integrating Answer Set Reasoning with Constraint Solving Techniques
- Logic Programming
- Multi-criteria optimization in answer set programming
- Multi-threaded ASP solving with clasp
- Principles and Practice of Constraint Programming – CP 2004
- Propagation via lazy clause generation
- Recent Advances in Constraints
- Representing constraint satisfaction problems in answer set programming
- Stable model semantics for founded bounds
- Technical communications of the 28th international conference on logic programming (ICLP 2012), September 4--8, 2012, Budapest, Hungary. Papers based on the presentations at the conference.
- Unsatisfiability-based optimization in clasp
Cited in
(21)- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Testing in ASP: revisited language and programming environment
- Clingcon
- Progress in clasp series 3
- Shared aggregate sets in answer set programming
- Constraint answer set programming without grounding
- Clingo goes linear constraints over reals and integers
- ASP modulo CSP: the clingcon system
- Manipulation of articulated objects using dual-arm robots via answer set programming
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Building Information Modeling Using Constraint Logic Programming
- A tutorial on hybrid answer set solving with \textit{clingo}
- Multi-shot ASP solving with clingo
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
- Unifying framework for optimizations in non-Boolean formalisms
- Integrating logic rules with everything else, seamlessly
- Answer set planning: a survey
- How to build your own ASP-based system?!
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
This page was built for publication: \textit{clingcon}: the next generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593092)
