Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution.
Allen Van GelderPublished in: AI&M (2002)
Keyphrases
- clause learning
- quantified boolean formulas
- unit propagation
- decision procedures
- satisfiability problem
- max sat
- sat problem
- sat solving
- high resolution
- boolean formula
- theorem proving
- sat solvers
- propositional logic
- phase transition
- low resolution
- computational complexity
- consequence finding
- data sets
- search tree
- np complete
- automated reasoning
- search strategies
- genetic algorithm