Dynamic Symmetry Breaking in SAT using Augmented Clauses with a Polynomial-Time Lexicographic Pruning.
Tevich TreethanyaphongAthasit SurarerksPublished in: EECS (2018)
Keyphrases
- boolean satisfiability
- symmetry breaking
- sat solvers
- search space
- sat solving
- constraint programming
- boolean optimization
- search tree
- symmetry breaking constraints
- probabilistic planning
- propositional satisfiability
- integer linear programming
- sat problem
- graph coloring
- boolean formula
- max sat
- constraint satisfaction problems
- pseudo boolean
- search algorithm
- global constraints
- special case