Solving difficult instances of Boolean satisfiability in the presence of symmetry.
Fadi A. AloulArathi RamaniIgor L. MarkovKarem A. SakallahPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2003)
Keyphrases
- boolean satisfiability
- boolean optimization
- random sat instances
- symmetry breaking
- maximum satisfiability
- sat instances
- pseudo boolean
- randomly generated
- sat solving
- stochastic local search
- sat solvers
- boolean formula
- integer linear programming
- branch and bound algorithm
- sat problem
- max sat
- random sat
- satisfiability problem
- probabilistic planning
- constraint programming
- search tree
- global constraints
- np complete
- propositional satisfiability
- graph coloring
- cutting plane
- integer program
- integer programming
- phase transition
- orders of magnitude
- dynamic programming