Translation-based constraint answer set solving

Authors:
Christian Drescher;Toby Walsh
Affiliations:
NICTA and University of New South Wales, Sydney, Australia;NICTA and University of New South Wales, Sydney, Australia
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 21
Cited 2

Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Propagation via lazy clause generation

Constraints
Answer Set Programming with Constraints Using Lazy Grounding

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Constraint Answer Set Solving

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Module-Based Framework for Multi-language Constraint Modeling

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Automatic generation of some results in finite algebra

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Circuit complexity and decompositions of global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Integrating answer set reasoning with constraint solving techniques

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
A translational approach to constraint answer set solving

Theory and Practice of Logic Programming
Towards an integration of answer set and constraint solving

ICLP'05 Proceedings of the 21st international conference on Logic Programming
A comparison of CLP(FD) and ASP solutions to NP-Complete problems

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Compiling finite linear CSP into SAT

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Exploiting constraints

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Relating constraint answer set programming languages and algorithms

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unit-propagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.