ASP modulo CSP: the clingcon system

DOI10.1017/S1471068412000142MaRDI QIDQ4911129zbMATH OpenFDO

Authors Max Ostrowski, Torsten Schaub

Publication date 13 March 2013

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

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

zbMATH Keywords

irreducible inconsistent setsnon-Boolean constraints

Mathematics Subject Classification ID

Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Abstract: 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. To appear in Theory and Practice of Logic Programming

Recommendations

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

Cites work

• Integrating answer set programming and constraint logic programming
• Lemma Learning in SMT on Linear Constraints
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Stable models and difference logic

Cited in

(28)

• Evaluating ASP and commercial solvers on the CSPLib
• Pruning external minimality checking for answer set programs using semantic dependencies
• Train scheduling with hybrid ASP
• The return of \textit{xorro}
• Industrial-size scheduling with ASP+CP
• aspartame: solving constraint satisfaction problems with answer set programming
• Progress in clasp series 3
• Clingo goes linear constraints over reals and integers
• A model building framework for answer set programming with external computations
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• \textit{clingcon}: the next generation
• CASP solutions for planning in hybrid domains
• Relating constraint answer set programming languages and algorithms
• Multi-threaded ASP solving with clasp
• Inlining external sources in answer set programs
• The External Interface for Extending WASP
• A tutorial on hybrid answer set solving with \textit{clingo}
• Partial compilation of ASP programs
• Multi-shot ASP solving with clingo
• Hybrid metabolic network completion
• ASP modulo CSP: The clingcon system.
• An abstract view on optimizations in propositional frameworks
• Clingraph: a system for ASP-based visualization
• Lazy atom discovery in compilation-based ASP solving
• Unifying framework for optimizations in non-Boolean formalisms
• Specifying and reasoning about CPS through the lens of the NIST CPS framework
• Answer set planning: a survey
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

Describes a project that uses

Uses Software

• Clingcon

This page was built for publication: ASP modulo CSP: the clingcon system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911129)