Equational prover of theorema

Authors:
Temur Kutsia
Affiliations:
Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria
Venue:
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Year:
2003

Citing 15
Cited 1

A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
Experiments with discrimination-tree indexing and path indexing for term retrieval

Journal of Automated Reasoning
Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
The Mathematica book (4th edition)

The Mathematica book (4th edition)
The TH ∃ OREM ∀ project: a progress report

Symbolic computation and automated reasoning
WALDMEISTER - High-Performance Equational Deduction

Journal of Automated Reasoning
DISCOUNT: A SYstem for Distributed Equational Deduction

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Substitution Tree Indexing

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Combining Computer Algebra and Rule Based Reasoning

AISMC-2 Selected Papers from the Second International Conference on Integrating Symbolic Mathematical Computation and Artificial Intelligence
Context Trees

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Term indexing

Handbook of automated reasoning
The Higher-Order Recursive Path Ordering

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On using ground joinable equations in equational theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
A phytography of WALDMEISTER

AI Communications - CASC

Solving equations with sequence variables and sequence functions

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.