Bridging Theorem Proving and Mathematical Knowledge Retrieval

Accessing knowledge of a single knowledge source with different client applications often requires the help of mediator systems as middleware components. In the domain of theorem proving large efforts have been made to formalize knowledge for mathematics and verification issues, and to structure it in databases. But these databases are either specialized for a single client, or if the knowledge is stored in a general database, the services this database can provide are usually limited and hard to adjust for a particular theorem prover. Only recently there have been initiatives to flexibly connect existing theorem proving systems into networked environments that contain large knowledge bases. An intermediate layer containing both, search and proving functionality can be used to mediate between the two.

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

[2]  Amy P. Felty,et al.  Hybrid Interactive Theorem Proving Using Nuprl and HOL , 1997, CADE.

[3]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[4]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[5]  Peter B. Andrews,et al.  Selectively Instantiating Definitions , 1998, CADE.

[6]  Jeffrey D. Ullman,et al.  MedMaker: a mediation system based on declarative specifications , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[7]  Ingo Dahn,et al.  Integration of Automated and Interactive Theorem Proving in ILP , 1997, CADE.

[8]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[9]  Peter B. Andrews,et al.  System Description: TPS: A Theorem Proving System for Type Theory , 2000, CADE.

[10]  Thomas Hillenbrand,et al.  System Description: Waldmeister - Improvements in Performance and Ease of Use , 1999, CADE.

[11]  Gio Wiederhold,et al.  Mediators in the architecture of future information systems , 1992, Computer.

[12]  Michael Kohlhase,et al.  System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving , 1999, CADE.

[13]  Alan Bundy,et al.  Automated Deduction — CADE-12 , 1994, Lecture Notes in Computer Science.

[14]  A. Campbell,et al.  Progress in Artificial Intelligence , 1995, Lecture Notes in Computer Science.

[15]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[16]  Volker Sorge,et al.  Integrating Tps and Omega , 1999, J. Univers. Comput. Sci..

[17]  Peter Baumgartner,et al.  PROTEIN: A PROver with a Theory Extension INterface , 1994, CADE.

[18]  Andreas Meier.  System description : TRAMP transformation of machine-found proofs into natural deduction proofs at the assertion level , 2000 .

[19]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[20]  Andrzej Trybulec,et al.  Computer Assisted Reasoning with MIZAR , 1985, IJCAI.

[21]  Jacques Calmet,et al.  KOMET - A System for the Integration of Heterogeneous Information Sources , 1997, ISMIS.

[22]  Shusaku Tsumoto,et al.  Foundations of Intelligent Systems, 15th International Symposium, ISMIS 2005, Saratoga Springs, NY, USA, May 25-28, 2005, Proceedings , 2005, ISMIS.

[23]  William McCune.  Otter 2.0 , 1990, CADE.

[24]  Douglas J. Howe.  Importing Mathematics from HOL into Nuprl , 1996, TPHOLs.

[25]  Alessandro Armando,et al.  Towards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture , 2000, WOA.

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

[27]  Michael Kohlhase,et al.  MBase: Representing mathematical knowledge in a relational data base , 1999, Calculemus.

[28]  Stephen Wolfram,et al.  The Mathematica Book , 1996 .

[29]  Volker Sorge,et al.  ΩMEGA : Towards a mathematical assistant , 1997 .

[30]  Volker Sorge,et al.  Omega: Towards a Mathematical Assistant , 1997, CADE.

[31]  Volker Sorge,et al.  Critical Agents Supporting Interactive Theorem Proving , 1999, EPIA.

[32]  Richard J. Boulton,et al.  The PROSPER toolkit , 2003, International Journal on Software Tools for Technology Transfer.

[33]  Michael Kohlhase,et al.  System Description: MBASE, an Open Mathematical Knowledge Base , 2000, CADE.

[34]  Richard J. Boulton,et al.  An Interface between Clam and HOL , 1998, TPHOLs.

[35]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[36]  Frank van Harmelen,et al.  Experiments with proof plans for induction , 2004, Journal of Automated Reasoning.

[37]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[38]  Volker Sorge,et al.  Classifying Isomorphic Residue Classes , 2001, EUROCAST.

[39]  Xiaorong Huang,et al.  Human oriented proof presentation - a reconstructive approach , 1996, DISKI.

[40]  Bruno Buchberger,et al.  Computer Aided Systems Theory — EUROCAST 2001 , 2001, Lecture Notes in Computer Science.

[41]  Andreas Meier.  System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level , 2000, CADE.

[42]  Xiaorong Huang,et al.  Reconstruction Proofs at the Assertion Level , 1994, CADE.

[43]  Ian Green,et al.  System Description: Proof Planning in Higher-Order Logic with Lambda-Clam , 1998, CADE.

[44]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[45]  Christoph Kreitz,et al.  The Nuprl Open Logical Environment , 2000, CADE.

[46]  William McCune,et al.  Automated Deduction—CADE-14 , 1997, Lecture Notes in Computer Science.