Compiling finite domain constraints to SAT withBEE

DOI10.1017/S1471068412000130zbMATH Open1260.68081arXiv1206.3883OpenAlexW1972567131MaRDI QIDQ4911128FDOQ4911128

Michael Codish, Amit Metodi

Publication date: 13 March 2013

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

Abstract: We present BEE, a compiler which enables to encode finite domain constraint problems to CNF. Using BEE both eases the encoding process for the user and also performs transformations to simplify constraints and optimize their encoding to CNF. These optimizations are based primarily on equi-propagation and on partial evaluation, and also on the idea that a given constraint may have various possible CNF encodings. Often, the better encoding choice is made after constraint simplification. BEE is written in Prolog and integrates directly with a SAT solver through a suitable Prolog interface. We demonstrate that constraint simplification is often highly beneficial when solving hard finite domain constraint problems. A BEE implementation is available with this paper.

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

zbMATH Keywords

SAT encodingpartial evaluationequi-propagationFD constraints

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911128)