An Algorithm for the Retrieval of Unifiers from Discrimination Trees

Authors:
Hans De Nivelle
Affiliations:
CWI, PO BOX 94079, 1090 GB Amsterdam, The Netherlands e-mail:nivelle@cwi.nl
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 10
Cited 2

Note on McCune's article on discrimination trees

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

Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Fast Subsumption Algorithms

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Resolution Games and Non-Liftable Resolution Orderings

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Extended Path-Indexing

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
An Algorithm for the Retrieval of Unifiers from Discrimination Trees

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Vampire

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Term indexing

Handbook of automated reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a modification of the unification algorithm that is adapted tothe extraction of simultaneously unifiable literals from discriminationtrees. The algorithm is useful for efficient implementation of binaryresolution, hyperresolution, and paramodulation. The algorithm is able totraverse simultaneously more than one discrimination tree and to construct aunifier at the same time. In this way backtracking is reduced.