Integrating a SAT Solver with an LCF-style Theorem Prover.
Tjark WeberPublished in: Electron. Notes Theor. Comput. Sci. (2006)
Keyphrases
- theorem prover
- sat solvers
- automated reasoning
- first order logic
- theorem proving
- sat solving
- propositional satisfiability
- automated theorem proving
- orders of magnitude
- inference rules
- term rewriting
- search space
- constraint satisfaction
- boolean satisfiability
- sat instances
- formal proof
- max sat
- sat problem
- search strategies
- natural deduction
- boolean formula
- constraint solver
- clause learning
- answer sets
- sat encodings
- proof search
- symmetry breaking
- dynamic programming
- evolutionary algorithm
- data structure