Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
REDUCING HIGHER-ORDER THEOREM PROVING TO A SEQUENCE OF SAT PROBLEMS CHAD E. BROWN Abstract. We describe a complete theorem proving procedure for higher-order logic that uses SAT-solving to do much of the
Add to Reading List
Document Date: 2012-05-02 11:18:24
Open Document
File Size: 237,94 KB
Share Result on Facebook
UPDATE
REDUCING HIGHER-ORDER THEOREM PROVING TO A SEQUENCE OF SAT PROBLEMS CHAD E. BROWN Abstract. We describe a complete theorem proving procedure for higher-order logic that uses SAT-solving to do much of the