Conditional Term Equivalent Symmetry Breaking for SAT.
Timothy KoppParag SinglaHenry A. KautzPublished in: AAAI Workshops (2017)
Keyphrases
- symmetry breaking
- boolean satisfiability
- sat solvers
- sat solving
- propositional satisfiability
- constraint programming
- search tree
- graph coloring
- boolean optimization
- pseudo boolean
- global constraints
- constraint satisfaction problems
- integer linear programming
- sat problem
- satisfiability problem
- combinatorial problems
- max sat
- search algorithm
- randomly generated
- sat instances
- phase transition
- branch and bound algorithm
- search strategies
- traveling salesman problem
- scheduling problem
- search space