When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way.
Cheng-Shen HanJie-Hong Roland JiangPublished in: CAV (2012)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- branch and bound algorithm
- probabilistic planning
- sat solving
- integer linear programming
- randomly generated
- sat problem
- symmetry breaking
- maximum satisfiability
- linear programming
- max sat
- combinatorial problems
- np hard
- phase transition
- lower bound
- boolean formula
- propositional satisfiability
- scheduling problem
- constraint satisfaction
- search strategies
- genetic algorithm
- satisfiability problem
- computational complexity
- multi agent