Abstract

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) a given query term. In this paper a new indexing method is presented, which outperforms traditional methods such as path indexing, discrimination tree indexing and abstraction trees. Additionally, the new index not only supports term indexing but also provides maintenance and efficient retrieval of substitutions. As confirmed in multiple experiments, substitution trees combine maximal search speed and minimal memory requirements.

Citations

829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
42	Experiments with discrimination-tree indexing and path indexing for term retrieval - McCune - 1992
37	The Anatomy of Vampire. Implementing Bottom-up Procedures with Code Trees - Voronkov - 1995
23	Flatterms, Discrimination Nets, and Fast Term rewriting - Christian - 1993
20	The path indexing method for indexing terms - Stickel - 1989
11	Abstraction tree indexing for terms - Ohlbach - 1990
6	Data structures and control architecture for implementation of theorem-proving programs - Overbeek, Lusk - 1980
5	Extended path-indexing - Graf - 1994
4	Formula databases for high-performance resolution/paramodulation systems - Butler, Overbeek - 1994
4	Path indexing for term retrieval - Graf - 1992