Problem-Sensitive Restart Heuristics for the DPLL Procedure.
Carsten SinzMarkus IserPublished in: SAT (2009)
Keyphrases
- davis putnam
- propositional satisfiability
- proof procedure
- propositional logic
- search algorithm
- random walk
- np complete
- sat solvers
- branch and bound procedure
- tree search
- satisfiability problem
- heuristic search
- lower bound
- data sets
- theorem proving
- heuristic methods
- first order logic
- search strategies
- exact algorithms
- information retrieval