Boolean Satisfiability with Transitivity Constraints.
Randal E. BryantMiroslav N. VelevPublished in: CAV (2000)
Keyphrases
- boolean satisfiability
- symmetry breaking
- combinatorial problems
- branch and bound algorithm
- probabilistic planning
- randomly generated
- boolean optimization
- sat solving
- sat problem
- linear constraints
- sat solvers
- integer linear programming
- global constraints
- constraint programming
- random sat instances
- lower bound
- mixed integer
- graph coloring
- boolean formula
- constraint satisfaction
- special case