A translational approach to constraint answer set solving

DOI10.1017/S1471068410000220MaRDI QIDQ3585161zbMATHOpenAlexFDO

Authors Christian Drescher, Toby Walsh

Publication date 19 August 2010

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

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

zbMATH Keywords

decompositionanswer set programmingconstraint processing

Mathematics Subject Classification ID

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

Abstract: We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.

Recommendations

• Constraint Answer Set Solving
• Representing constraint satisfaction problems in answer set programming
• Logic Programming
• Constraint answer set programming systems
• Integrating answer set programming and constraint logic programming

Cites work

• Bounded LTL model checking with stable models
• Extending and implementing the stable model semantics
• Handbook of constraint programming.
• Integrating answer set programming and constraint logic programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)

Cited in

(22)

• Stable model semantics for founded bounds
• Weight constraint programs with evaluable functions
• Constraint answer set programming without grounding
• FOLASP: FO(·) as Input Language for Answer Set Solvers
• Modelling grammar constraints with answer set programming
• Representing constraint satisfaction problems in answer set programming
• Enhancing ASP Systems for Planning with Temporal Constraints
• Answer set solving with lazy nogood generation
• A general method to solve complex problems by combining multiple answer set programs
• Logic programming
• scientific article; zbMATH DE number 3926286 (Why is no real title available?)
• Logic Programming
• Detection and exploitation of functional dependencies for model generation
• Constraint answer set programming systems
• \textit{clingcon}: the next generation
• A First Order Forward Chaining Approach for Answer Set Computing
• Relating constraint answer set programming languages and algorithms
• aspartame: solving constraint satisfaction problems with answer set programming
• Translation-based approaches for solving disjunctive temporal problems with preferences
• Clingo goes linear constraints over reals and integers
• Constraint answer set solver EZCSP and why integration schemas matter
• Conflict-driven answer set solving: from theory to practice

Describes a project that uses

Uses Software

• CSPLib
• clasp
• Clingcon

This page was built for publication: A translational approach to constraint answer set solving

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