A translational approach to constraint answer set solving
From MaRDI portal
Publication:3585161
DOI10.1017/S1471068410000220zbMATH Open1209.68511arXiv1007.4114OpenAlexW2132878464MaRDI QIDQ3585161FDOQ3585161
Authors: Christian Drescher, Toby Walsh 
Publication date: 19 August 2010
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1007.4114
Recommendations
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.
- 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)\)
- Bounded LTL model checking with stable models
Cited In (22)
- Constraint answer set programming without grounding
- Translation-based approaches for solving disjunctive temporal problems with preferences
- Relating constraint answer set programming languages and algorithms
- Constraint answer set programming systems
- Logic programming
- Logic Programming
- Enhancing ASP Systems for Planning with Temporal Constraints
- Answer set solving with lazy nogood generation
- Clingo goes linear constraints over reals and integers
- FOLASP: FO(·) as Input Language for Answer Set Solvers
- Constraint answer set solver EZCSP and why integration schemas matter
- Conflict-driven answer set solving: from theory to practice
- Representing constraint satisfaction problems in answer set programming
- Modelling grammar constraints with answer set programming
- aspartame: solving constraint satisfaction problems with answer set programming
- Weight constraint programs with evaluable functions
- Stable model semantics for founded bounds
- Title not available (Why is that?)
- A First Order Forward Chaining Approach for Answer Set Computing
- A general method to solve complex problems by combining multiple answer set programs
- \textit{clingcon}: the next generation
- Detection and exploitation of functional dependencies for model generation
Uses Software
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)
