Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut.
Michael CodishYoav FeketeAmit MetodiPublished in: CoRR (2013)
Keyphrases
- finite domain
- satisfiability problem
- constraint programming
- constraint satisfaction problems
- constraint propagation
- constraint solving
- constraint solver
- np complete
- constraint logic programming
- search algorithm
- constraint satisfaction
- sat solvers
- bounded treewidth
- phase transition
- combinatorial problems
- global constraints
- search strategies
- linear constraints
- temporal logic
- knowledge representation
- state variables