Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science
Increasing model building capabilities by constraint solving on terms with integer exponents
Journal of Symbolic Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
WALDMEISTER - High-Performance Equational Deduction
Journal of Automated Reasoning
SPIKE, an Automatic Theorem Prover
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The Unification of Infinite Sets of Terms and Its Applications
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
On Finite Representations of Infinite Sequences of Terms
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Handbook of automated reasoning
Handbook of automated reasoning
Handbook of automated reasoning
Dei: A Theorem Prover for Terms with Integer Exponents
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A divergence critic for inductive proof
Journal of Artificial Intelligence Research
Towards systematic analysis of theorem provers search spaces: first steps
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Simplified handling of iterated term schemata
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Perfect discrimination trees [12] are used by many efficient resolution and superposition-based theorem provers (e.g. E-prover [17], Waldmeister [10], Logic Reasoner, ...) in order to efficiently implement rewriting and unit subsumption. We extend this indexing technique to handle a class of terms with integer exponents (or I-terms), a schematisation language allowing to capture sequences of iterated patterns [8]. We provide an algorithm to construct the so called perfect discrimination graphs from I-terms and to retrieve indexed I-terms from their instances. Our research is essentially motivated (but not restricted to) by some approaches to inductive proofs, for which termination of the proof procedure is capital.