The order encoding: from tractable CSP to tractable SAT

Authors:
Justyna Petke;Peter Jeavons
Affiliations:
Oxford University Computing Laboratory, Parks Road, Oxford, UK;Oxford University Computing Laboratory, Parks Road, Oxford, UK
Venue:
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Year:
2011

Citing 5
Cited 1

Tractable constraints on ordered domains

Artificial Intelligence
Building tractable disjunctive constraints

Journal of the ACM (JACM)
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Compiling finite linear CSP into SAT

Constraints
Local consistency and SAT-solvers

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming

Azucar: a SAT-based CSP solver using compact order encoding

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract