Abstract

The equational prover of the Theorema system is described. It is implemented on Mathematica and is designed for unit equalities in the first order or in the applicative higher order form. A (restricted) usage of sequence variables and Mathematica built-in functions is allowed.

Citations

254	Otter 3.0 Reference Manual and Guide - McCune - 1994
120	Completion without failure - Bachmair, Dershowitz, et al. - 1989
94	A Prolog technology theorem prover: implementation by an extended Prolog compiler - Stickel - 1986
84	Higher-order extensions to Prolog | are they needed - Warren - 1981
69	Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
52	The Theorema Project: A Progress Report - Buchberger, Dupre, et al. - 2000
42	Experiments with discrimination-tree indexing and path indexing for term retrieval - McCune - 1992
38	A.: Term indexing - Ramakrishnan, Sekar, et al. - 2001
37	The Anatomy of Vampire. Implementing Bottom-up Procedures with Code Trees - Voronkov - 1995
35	Discount: a system for distributed equational deduction - Avenhaus, Denzinger, et al. - 1995
27	Substitution Tree Indexing - Graf - 1995
26	Symbolic Computation: Computer Algebra and Logic - Buchberger - 1996
22	The TPTP problem library for automated theorem proving, 2001. Available at http://www.tptp.org - Sutcliffe, Suttner
20	Mathematica as a rewrite language - Buchberger - 1996
20	Analysis and Representation of Equational Proofs Generated by a Distributed Completion Based Proof System - Denzinger, Schulz - 1994
20	The path indexing method for indexing terms - Stickel - 1989
19	Solving and Proving in Equational Theories with Sequence Variables and Flexible Arity Symbols - Kutsia - 2002
11	A Phytography of Waldmeister - Hillenbrand, Löchner - 2002
10	A correctness proof for Warren's HO into FO translation - Gonzalez-Moreno - 1993
9	Using Mathematica for doing simple mathematical proofs, invited talk at - Buchberger - 1996
9	The Mathematica Book, Cambridge University Press - Wolfram - 1999
7	Theorem proving with sequence variables and flexible arity symbols - Kutsia - 2002
6	P.: Context trees - Ganzinger, Nieuwenhuis, et al. - 2001
6	Waldmeister: Highperformance equational deduction - Hillenbrand, Buch, et al. - 1997
4	On using ground joinable equations in equational theorem proving - Hillenbrand, Löchner
4	Combining computer algebra and rule based reasoning - Bundgen - 1994
3	A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses (System description - Nieuwenhuis, Rivero, et al. - 1997
2	Uni with sequence variables and arity symbols and its extension with pattern-terms - Kutsia - 2002
2	Introducing sequentica - Marin - 2002
1	Flatterms, discrimination trees, and fast term rewriting - Christian - 1993
1	The higher order recursive path ordering - Jouannaud, Rubio - 1999