First Page | Document Content | |
---|---|---|
Date: 2010-07-28 04:32:18Mathematics Theoretical computer science Automated theorem proving Algebra Logic in computer science Algebraic structures Semiring Boolean satisfiability problem DPLL algorithm Unit propagation Maximum satisfiability problem Resolution | Semiring-Induced Propositional Logic: Definition and Basic Algorithms ∗ † Javier Larrosa, Albert Oliveras and Enric Rodr´ıguez-Carbonell Technical University of Catalonia Barcelona, Spain larrosa,oliveras,erodri@lsAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source WebsiteFile Size: 256,51 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 |