Compiling finite domain constraints to SAT with BEE.
Amit MetodiMichael CodishPublished in: Theory Pract. Log. Program. (2012)
Keyphrases
- finite domain
- satisfiability problem
- constraint programming
- constraint satisfaction problems
- constraint propagation
- constraint solving
- constraint solver
- constraint logic programming
- np complete
- phase transition
- sat solvers
- search strategies
- temporal logic
- combinatorial problems
- constraint satisfaction
- bounded treewidth
- search algorithm
- answer set programming
- state variables
- global constraints
- temporal constraints
- constraint networks
- linear constraints
- temporal information