ASP modulo CSP: The clingcon system

DOI10.1017/S1471068412000142zbMath1260.68066arXiv1210.2287MaRDI QIDQ4911129

Torsten Schaub, Max Ostrowski

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 sets; non-Boolean constraints

Mathematics Subject Classification ID

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

68N17: Logic programming

Related Items

A model building framework for answer set programming with external computations, ASPeRiX, a first-order forward chaining approach for answer set computing, Clingcon: The next generation, CASP solutions for planning in hybrid domains, Inlining External Sources in Answer Set Programs, The External Interface for Extending WASP, Partial Compilation of ASP Programs, Hybrid metabolic network completion, Multi-shot ASP solving with clingo, Relating constraint answer set programming languages and algorithms, Pruning external minimality checking for answer set programs using semantic dependencies, aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming, Progress in clasp Series 3

Uses Software

• Clingcon

Cites Work

• Integrating answer set programming and constraint logic programming
• Stable models and difference logic
• Solving SAT and SAT Modulo Theories
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Lemma Learning in SMT on Linear Constraints