Accelerating Boolean Satisfiability (SAT) solving by common subclause elimination.
Forrest Sheng BaoChris E. GutierrezJeriah Jn-CharlesYaowei YanYuanlin ZhangPublished in: Artif. Intell. Rev. (2018)
Keyphrases
- sat solving
- boolean satisfiability
- sat solvers
- boolean optimization
- sat problem
- probabilistic planning
- branch and bound algorithm
- randomly generated
- symmetry breaking
- phase transition
- max sat
- integer linear programming
- combinatorial problems
- satisfiability problem
- search strategies
- heuristic search
- search algorithm
- combinatorial optimization
- sat instances
- orders of magnitude
- special case
- search space