The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) some query term. Among the known indexing methods for term retrieval in deduction systems, Path-Indexing exhibits a good performance in general. However, as Path-Indexing is not a perfect filter, the candidates found by this method still have to be subjected to a unification algorithm in order to detect failures resulting from occur-checks or indirect clashes. As perfect filters, discrimination trees and abstraction trees thus outperform Path-Indexing in some cases. We present an improved version of Path- Indexing that provides both the query trees and the Path-Index with indirect clash and occur-check information. Thus compared to the standard method we dismiss much more terms as possible candidates.
CITATION STYLE
Graf, P. (1994). Extended path-indexing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 814 LNAI, pp. 514–528). Springer Verlag. https://doi.org/10.1007/3-540-58156-1_37
Mendeley helps you to discover research relevant for your work.