\textit{clingcon}: the next generation

DOI10.1017/S1471068417000138zbMATH Open1379.68040arXiv1705.04569MaRDI QIDQ4593092FDOQ4593092

Authors: Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub 

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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)

Full work available at URL: https://arxiv.org/abs/1705.04569

Recommendations

• ASP modulo CSP: the clingcon system
• Constraint Answer Set Solving
• ASP modulo CSP: The clingcon system.
• A tutorial on hybrid answer set solving with \textit{clingo}
• Clingo goes linear constraints over reals and integers

zbMATH Keywords

constraint programming (CP)answer set programming (ASP)constraint answer set programming (CASP)SAT modulo theories (SMT)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cites Work

• Extending and implementing the stable model semantics
• Handbook of constraint programming.
• Constraint Answer Set Solving
• Conflict-driven ASP solving with external sources
• Title not available (Why is that?)
• Integrating answer set programming and constraint logic programming
• Propagation via lazy clause generation
• Representing constraint satisfaction problems in answer set programming
• GRASP: a search algorithm for propositional satisfiability
• Multi-threaded ASP solving with clasp
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
• Title not available (Why is that?)
• Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
• Compiling finite linear CSP into SAT
• A translational approach to constraint answer set solving
• ASP modulo CSP: the clingcon system
• Logic Programming
• Unsatisfiability-based optimization in clasp
• Principles and Practice of Constraint Programming – CP 2004
• Stable model semantics for founded bounds
• Multi-criteria optimization in answer set programming
• A SAT-based method for solving the two-dimensional strip packing problem
• Recent Advances in Constraints
• Title not available (Why is that?)
• 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.
• aspartame: solving constraint satisfaction problems with answer set programming
• Integrating Answer Set Reasoning with Constraint Solving Techniques
• Answer set solving with lazy nogood generation

Cited In (14)

• Constraint answer set programming without grounding
• ASP modulo CSP: the clingcon system
• A tutorial on hybrid answer set solving with \textit{clingo}
• Progress in clasp series 3
• Clingo goes linear constraints over reals and integers
• Title not available (Why is that?)
• Clingcon
• Multi-shot ASP solving with clingo
• 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
• Building Information Modeling Using Constraint Logic Programming
• Adaptive large-neighbourhood search for optimisation in answer-set programming
• Manipulation of articulated objects using dual-arm robots via answer set programming
• Shared aggregate sets in answer set programming

Uses Software

• Gringo
• clasp
• Sugar

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)