A translational approach to constraint answer set solving

DOI10.1017/S1471068410000220zbMath1209.68511arXiv1007.4114OpenAlexW2132878464MaRDI QIDQ3585161

Toby Walsh, Christian Drescher

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)

Related Items (7)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Clingo goes linear constraints over reals and integers ⋮ Clingcon: The next generation ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ Weight constraint programs with evaluable functions ⋮ Relating constraint answer set programming languages and algorithms ⋮ Stable model semantics for founded bounds

Uses Software

• CSPLib
• clasp
• Clingcon

Cites Work

• Unnamed Item
• Integrating answer set programming and constraint logic programming
• Extending and implementing the stable model semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• Solving SAT and SAT Modulo Theories
• Bounded LTL model checking with stable models

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