Compiling finite domain constraints to SAT withBEE

DOI10.1017/S1471068412000130zbMath1260.68081arXiv1206.3883OpenAlexW1972567131MaRDI QIDQ4911128

Michael Codish, Amit Metodi

Publication date: 13 March 2013

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

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

zbMATH Keywords

partial evaluationSAT encodingequi-propagationFD constraints

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (9)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Optimal-depth sorting networks ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ What is answer set programming to propositional satisfiability ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings ⋮ BEE ⋮ Constraints for symmetry breaking in graph representation ⋮ meSAT: multiple encodings of CSP to SAT

Cites Work

• Cardinality networks: a theoretical and empirical study
• Compiling finite linear CSP into SAT
• Evaluating ASP and commercial solvers on the CSPLib
• A theory of diagnosis from first principles
• Compiling problem specifications into SAT

This page was built for publication: Compiling finite domain constraints to SAT withBEE