|
|
PAAR-2014: Author IndexAuthor | Papers |
---|
A | Arhami, Negin | The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics | B | Bax, Joshua | A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories | Bonacina, Maria Paola | SGGS Theorem Proving: an Exposition | C | Cruanes, Simon | Logtk : A Logic ToolKit for Automated Reasoning and its Implementation | D | Dougherty, Daniel | Razor: Provenance and Exploration in Model-Finding | E | Echenim, Mnacho | A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses | G | Gauthier, Thibault | Beagle as a HOL4 external ATP method | K | Kaliszyk, Cezary | Beagle as a HOL4 external ATP method Machine Learner for Automated Reasoning 0.4 and 0.5 | Keller, Chantal | Beagle as a HOL4 external ATP method | N | Nassar, Muhammad | Automated Theorem Proving using the TPTP Process Instruction Language | Norrish, Michael | Beagle as a HOL4 external ATP method | P | Peltier, Nicolas | A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses | Plaisted, David | SGGS Theorem Proving: an Exposition | S | Saghafi, Salman | Razor: Provenance and Exploration in Model-Finding | Sutcliffe, Geoff | The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics Automated Theorem Proving using the TPTP Process Instruction Language | T | Tourret, Sophie | A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses | U | Urban, Josef | Machine Learner for Automated Reasoning 0.4 and 0.5 | V | Vyskocil, Jiri | Machine Learner for Automated Reasoning 0.4 and 0.5 | W | Waldmann, Uwe | Hierarchic Superposition Revisited | Wand, Daniel | Polymorphic+Typeclass Superposition |
|
|
|