Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution.
Paul BeameAshish SabharwalPublished in: AAAI (2014)
Keyphrases
- sat solvers
- preprocessing
- clause learning
- clause learning sat solvers
- max sat
- highly efficient
- search space
- search tree
- boolean satisfiability
- constraint satisfaction
- search strategies
- sat instances
- propositional satisfiability
- sat problem
- information retrieval
- weighted max sat
- sat solving
- lower bound
- special case
- temporal logic
- orders of magnitude