# Publication details

##
Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems

Chad E. Brown

Journal of Automated Reasoning 51(1):57-77, March 2013

We describe a complete theorem proving procedure for higher-order logic that uses SAT-solving to do much of the heavy lifting. The theoretical basis for the procedure is a complete, cut-free, ground refutation calculus that incorporates a restriction on instantiations. The refined nature of the calculus makes it conceivable that one can search in the ground calculus itself, obtaining a complete procedure without resorting to meta-variables and a higher-order lifting lemma. Once one commits to searching in a ground calculus, a natural next step is to consider ground formulas as propositional literals and the rules of the calculus as propositional clauses relating the literals. With this view in mind, we describe a theorem proving procedure that primarily generates relevant formulas along with their corresponding propositional clauses. The procedure terminates when the set of propositional clauses is unsatisfiable. We prove soundness and completeness of the procedure. The procedure has been implemented in a new higher-order theorem prover, Satallax, which makes use of the SAT-solver MiniSat. We also describe the implementation and give several examples. Finally, we include experimental results of Satallax on the higher-order part of the TPTP library.

*Available Online at Springer*

Download PDF
Show BibTeX

@ARTICLE{Brown2012a,
title = {Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems},
author = {Chad E. Brown},
year = {2013},
month = {Mar},
journal = {Journal of Automated Reasoning},
volume = {51},
pages = {57-77},
number = {1},
}

Login to edit

Legal notice, Privacy policy