Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems.
Chad E. BrownPublished in: CADE (2011)
Keyphrases
- theorem proving
- higher order
- sat problem
- first order logic
- automated reasoning
- satisfiability problem
- propositional satisfiability
- inference rules
- parallel search
- theorem prover
- sat solvers
- proof planning
- term rewriting
- np complete
- pairwise
- randomly generated
- constraint satisfaction problems
- consequence finding
- geometry theorem proving
- max sat
- phase transition
- sat instances
- proof procedure
- decision problems
- building intelligent
- evolutionary algorithm
- artificial intelligence