Symmetry breaking for pseudo-Boolean formulas.
Fadi A. AloulArathi RamaniIgor L. MarkovKarem A. SakallahPublished in: ACM J. Exp. Algorithmics (2007)
Keyphrases
- symmetry breaking
- boolean formula
- sat solvers
- boolean satisfiability
- search tree
- constraint programming
- propositional satisfiability
- orders of magnitude
- sat problem
- np complete
- max sat
- sat instances
- constraint satisfaction
- global constraints
- practical problems
- search strategies
- constraint satisfaction problems
- graph coloring
- binary decision diagrams
- search space
- linear constraints
- integer linear programming
- combinatorial problems
- membership queries
- boolean functions
- retrieval effectiveness
- upper bound