<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2015-12-11 18:43:06Theoretical computer science Mathematical logic Mathematics Constraint programming Automated theorem proving Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem DPLL algorithm Symbol Conjunctive normal form |
Add to Reading List |
LNCSA Tutorial on Satisfiability Modulo Theories | 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 |