Deduktionsagenten h¨ oherer Ordnung fur mathematische Assistenzsysteme

[1]  Per Martin-Löf,et al.  Intuitionistic type theory , 1984, Studies in proof theory.

[2]  Herman Geuvers,et al.  Proof-Assistants Using Dependent Type Systems , 2001, Handbook of Automated Reasoning.

[3]  I. V. Ramakrishnan,et al.  Term Indexing , 1995, Lecture Notes in Computer Science.

[4]  Gopalan Nadathur,et al.  Higher-Order Logic Programming , 1986, ICLP.

[5]  Dieter Hutter,et al.  The Development Graph Manager MAYA , 2002, AMAST.

[6]  Wayne Snyder,et al.  Higher-Order Unification Revisited: Complete Sets of Transformations , 1989, J. Symb. Comput..

[7]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[8]  Richard J. Boulton,et al.  The PROSPER Toolkit , 2000, TACAS.

[9]  Warren D. Goldfarb,et al.  The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..

[10]  Dieter Hutter,et al.  VSE: formal methods meet industrial needs , 2000, International Journal on Software Tools for Technology Transfer.

[11]  T. Pietrzykowski,et al.  A complete mechanization of (ω) -order type theory , 1972, ACM Annual Conference.

[12]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[13]  Gernot Stenz,et al.  E-SETHEO: Design, Configuration and Use of a Parallel Automated Theorem Prover , 1999, Australian Joint Conference on Artificial Intelligence.

[14]  David De Roure,et al.  On self-organization and the semantic grid , 2003 .

[15]  Bruno Buchberger.  Theory exploration versus theorem proving , 1999, Calculemus.

[16]  Michael Kohlhase,et al.  Mechanising Partiality With Re-implementation , 1997, KI.

[17]  Gerard P. Hubt.  A mechanization of type theory , 1973, IJCAI 1973.

[18]  J. H. Geuvers,et al.  The calculus of constructions and higher order logic , 1995 .

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

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

[21]  Volker Sorge,et al.  Towards Fine-Grained Proof Planning with Critical Agents , 1999 .

[22]  Armin Fiedler.  User-adaptive proof explanation , 2001 .

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

[24]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[25]  Armin Fiedler,et al.  P.rex: An Interactive Proof Explainer , 2001, IJCAR.

[26]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

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

[28]  Willard Van Orman Quine.  Mengenlehre und ihre Logik , 1973 .

[29]  Maria Paola Bonacina,et al.  A taxonomy of parallel strategies for deduction , 2001, Annals of Mathematics and Artificial Intelligence.

[30]  Piergiorgio Bertoli,et al.  Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements , 2002, AISC.

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

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

[33]  Wayne Snyder,et al.  Complete Sets of Transformations for General E-Unification , 1989, Theor. Comput. Sci..

[34]  Claude Kirchner,et al.  External Rewriting for Skeptical Proof Assistants , 2003, Journal of Automated Reasoning.

[35]  Volker Sorge,et al.  Proof Development with OMEGA , 2002, CADE.

[36]  Franz Baader,et al.  KI 2001: Advances in Artificial Intelligence , 2001, Lecture Notes in Computer Science.

[37]  Christoph Benzmüller,et al.  System Description: LEO - A Higher-Order Theorem Prover , 1998, CADE.

[38]  Claude Kirchner,et al.  HOL-λσ: an intentional first-order expression of higher-order logic , 2001, Mathematical Structures in Computer Science.

[39]  Jörg Denzinger,et al.  Cooperation of Heterogeneous Provers , 1999, IJCAI.

[41]  Christoph Benzmüller.  Equality and Extensionality in Higher-Order Theorem Proving , 1999 .

[42]  Thomas Hillenbrand,et al.  The Next W ALDMEISTER Loop , 2002, CADE.

[43]  Natarajan Shankar,et al.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[44]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[45]  Volker Sorge,et al.  Agent-Oriented Integration of Distributed Mathematical Services , 1999, J. Univers. Comput. Sci..

[46]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

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

[48]  Leon Henkin,et al.  The Discovery of My Completeness Proofs , 1996, Bulletin of Symbolic Logic.

[49]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[50]  Christoph Weidenbach.  System Description: Spass Version 1.0.0 , 1999, CADE.

[51]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

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

[53]  Harald Ganzinger,et al.  Superposition Modulo a Shostak Theory , 2003, CADE.

[54]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

[55]  Jörg H. Siekmann,et al.  Proof Development with Omega-MEGA: sqrt(2) Is Irrational , 2002, LPAR.

[56]  Arjeh M. Cohen,et al.  Certifying Solutions to Permutation Group Problems , 2003, CADE.

[57]  de Ng Dick Bruijn,et al.  The mathematical language AUTOMATH, its usage, and some of its extensions , 1970 .

[58]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[59]  Harald Ganzinger,et al.  Superposition with equivalence reasoning and delayed clause normal form transformation , 2005, Inf. Comput..

[60]  Dieter Hutter,et al.  System Description: inka 5.0 - A Logic Voyager , 1999, CADE.

[61]  Christoph Benzmüller,et al.  The CALCULEMUS research training network: A short overview , 2003 .

[62]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

[63]  Volker Sorge,et al.  -Ants { An open approach at combining Interactive and Automated Theorem Proving , 2002 .

[64]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[65]  Frank Pfenning,et al.  TPS: A theorem-proving system for classical type theory , 1996, Journal of Automated Reasoning.

[66]  M. Randall Holmes.  Subsystems of Quine's "New Foundations" with Predicativity Restrictions , 1999, Notre Dame J. Formal Log..

[67]  Brigitte Pientka.  Higher-Order Substitution Tree Indexing , 2003, ICLP.

[68]  Peter B. Andrews.  General models and extensionality , 1972, Journal of Symbolic Logic.

[69]  Christoph Benzmüller,et al.  A calculus and a system architecture for extensional higher-order resolution , 1997 .

[70]  Alessandro Armando,et al.  Constraint contextual rewriting , 2003, J. Symb. Comput..

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

[72]  Volker Sorge,et al.  A Blackboard Architecture for Guiding Interactive Proofs , 1998, AIMSA.

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

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

[75]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[76]  Christoph Benzmu╠êller,et al.  A calculus and a system architecture for extensional higher-order resolution , 1997 .

[77]  Gérard P. Huet,et al.  A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..

[78]  GERARD P. HUET,et al.  The Undecidability of Unification in Third Order Logic , 1973, Inf. Control..

[79]  Christoph Benzmüller,et al.  Extensional Higher-Order Paramodulation and RUE-Resolution , 1999, CADE.

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

[81]  Aaron Stump,et al.  Subset Types and Partial Functions , 2003, CADE.

[82]  Kurt Schutte.  Syntactical and Semantical Properties of Simple Type Theory , 1960 .

[83]  Christoph Benzmüller,et al.  Comparing Approaches To Resolution Based Higher-Order Theorem Proving , 2002, Synthese.

[84]  Chad E. Brown.  Solving for Set Variables in Higher-Order Theorem Proving , 2002, CADE.

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

[86]  M. Randall Holmes,et al.  The Watson Theorem Prover , 2004, Journal of Automated Reasoning.

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

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

[89]  J. Denzinger,et al.  Cooperating Theorem Provers , 1998 .

[90]  Peter B. Andrews.  Refutations by Matings , 1976, IEEE Transactions on Computers.

[91]  Jörg H. Siekmann,et al.  Proof Development with Ωmega: The Irrationality of \(\sqrt 2\) , 2003 .

[92]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.