Proof Generation for Saturating First-Order Theorem Provers

[1]  Michaël Rusinowitch,et al.  On Word Problems in Equational Theories , 1987, ICALP.

[2]  Michael Norrish,et al.  seL4: formal verification of an OS kernel , 2009, SOSP '09.

[3]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[4]  Deepak Ramachandran,et al.  First-Orderized ResearchCyc : Expressivity and Efficiency in a Common-Sense Ontology , 2005 .

[5]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[6]  Journal of automated reasoning , 1986 .

[7]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[8]  Jörg Denzinger,et al.  Recording and Analysing Knowledge-Based Distributed Deduction Processes , 1996, J. Symb. Comput..

[9]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[10]  Christoph Weidenbach,et al.  Common Syntax of the DFG-Schwerpunktprogramm ''Deduktion'' , 1996 .

[11]  Peter Baumgartner,et al.  Implementing the Model Evolution Calculus , 2006, Int. J. Artif. Intell. Tools.

[12]  Tobias Nipkow,et al.  Sledgehammer: Judgement Day , 2010, IJCAR.

[13]  Graham Steel Visualising First-Order Proof Search , 2005 .

[14]  William McCune,et al.  OTTER 3.3 Reference Manual , 2003, ArXiv.

[15]  Douglas B. Lenat,et al.  CYC: a large-scale investment in knowledge infrastructure , 1995, CACM.

[16]  Reinhold Letz,et al.  Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.

[17]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[18]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[19]  Christoph Weidenbach,et al.  SPASS Version 3.5 , 2009, CADE.

[20]  O. Caprotti,et al.  OpenMath and MathML: semantic markup for mathematics , 1999, CROS.

[21]  Jörg Denzinger,et al.  DISCOUNT - A Distributed and Learning Equational Prover , 2004, Journal of Automated Reasoning.

[22]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[23]  Thomas C. Hales,et al.  Introduction to the Flyspeck Project , 2005, Mathematics, Algorithms, Proofs.

[24]  Adam Pease,et al.  Towards a standard upper ontology , 2001, FOIS.

[25]  Joachim Steinbach,et al.  SETHEO and E-SETHEO - The CADE-13 Systems , 2004, Journal of Automated Reasoning.

[26]  Geoff Sutcliffe,et al.  Semantic Derivation Verification , 2005, FLAIRS Conference.

[27]  Jasmin Christian Blanchette,et al.  Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers , 2012, IWIL@LPAR.

[28]  Koen Claessen,et al.  Using the TPTP Language for Writing Derivations and Finite Interpretations , 2006, IJCAR.

[29]  Larry Wos,et al.  Otter - The CADE-13 Competition Incarnations , 1997, Journal of Automated Reasoning.

[30]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[31]  Konstantin Korovin System Description : iProver – An Instantiation-Based Theorem Prover for First-Order Logic , 2008 .

[32]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[33]  Geoff Sutcliffe,et al.  An Interactive Derivation Viewer , 2007, UITP@FLoC.

[34]  Wolfgang Bibel,et al.  leanCoP: lean connection-based theorem proving , 2003, J. Symb. Comput..

[35]  Wolfgang Bibel,et al.  SETHEO: A high-performance theorem prover , 1992, Journal of Automated Reasoning.

[36]  Michael Kohlhase,et al.  OMDOC: Towards an Internet Standard for the Administration, Distribution, and Teaching of Mathematical Knowledge , 2000, AISC.

[37]  Felix Brandt,et al.  Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving , 1999, FLAIRS.

[38]  Andrei Voronkov,et al.  The anatomy of vampire , 1995, Journal of Automated Reasoning.

[39]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[40]  Stephan Schulz Learning Search Control Knowledge for Equational Theorem Proving , 2001, KI/ÖGAI.

[41]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[42]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[43]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[44]  Cezary Kaliszyk,et al.  MaSh: Machine Learning for Sledgehammer , 2013, ITP.

[45]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[46]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[47]  William McCune,et al.  Ivy: a preprocessor and proof checker for first-order logic , 2000 .

[48]  Geoff Sutcliffe,et al.  TSTP Data-Exchange Formats for Automated Theorem Proving Tools , 2004 .

[49]  L. Bachmair,et al.  Completion without Failure 1 , 1989 .

[50]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[51]  Jörg Denzinger,et al.  Analysis and Representation of Equational Proofs Generated by a Distributed Completion Based Proof System , 1994 .

[52]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

[53]  Jörg Denzinger,et al.  Learning Domain Knowledge to Improve Theorem Proving , 1996, CADE.

[54]  Christoph Weidenbach,et al.  SPASS & FLOTTER Version 0.42 , 1996, CADE.

[55]  Andrei Voronkov,et al.  Vampire 1.1 (System Description) , 2001, IJCAR.

[56]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[57]  Jesse Alama,et al.  Premise Selection for Mathematics by Corpus Analysis and Kernel Methods , 2011, Journal of Automated Reasoning.

[58]  Yi Gao,et al.  Automated Generation of Interesting Theorems , 2006, FLAIRS.

[59]  Raymond Reiter Two Results on Ordering for Resolution with Merging and Linear Format , 1971, JACM.

[60]  Jörg Denzinger,et al.  Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts , 2000, Inf. Comput..