First Page | Document Content | |
---|---|---|
Date: 2014-06-27 12:47:14Theoretical computer science Mathematics Computational complexity theory Logic in computer science Automated theorem proving NP-complete problems Electronic design automation Formal methods Conflict-driven clause learning Boolean satisfiability problem Clause Unit propagation | A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft ResearchAdd to Reading ListSource URL: csl.sri.comDownload Document from Source WebsiteFile Size: 363,26 KBShare Document on Facebook |
AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTIONDocID: 1vah4 - View Document | |
Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both forDocID: 1sXwT - View Document | |
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa JohanssonDocID: 1sOSK - View Document | |
Microsoft Word - BlankPageDocID: 1rugC - View Document | |
SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, GermanyDocID: 1rrok - View Document |