Abstract
Indexing data structures have a crucial impact on the performance of automated theorem provers. Examples are discrimination trees, which are like tries where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by means of a limited kind of context variables, common subterms also can be shared, even if they occur below different function symbols. Apart from introducing the concept, we also provide evidence for its practical value. We show how context trees can be implemented by means of abstract machine instructions. Experiments with benchmarks for forward matching show that our implementation is competitive with tightly coded current state-of-the-art implementations of the other main techniques. In particular, space consumption of context trees is significantly less than for other index structures.
This is a preview of subscription content, log in via an institution to check access.
References
Christian, J. (1993) Flatterms, discrimination nets, and fast term rewriting, J. Automated Reasoning 10, 95-113.
Graf, P. (1995) Substitution tree indexing, in J. Hsiang (ed.), 6th RTA (Kaiserslautern, Germany), Springer-Verlag, pp. 117-131.
Ganzinger, H., Nieuwenhuis, R. and Nivela, P. (2001) Context trees, in R. Goré, A. Leitsch, and T. Nipkow (eds.), Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR 2001) (Siena, Italy), LNAI 2083, Springer-Verlag, pp. 242-256.
Hillenbrand, T., Buch, A., Vogt, R. and Löchner, B. (1997) WALDMEISTER-High-performance equational deduction, J. Automated Reasoning 18(2), 265-270.
McCune, W. (1992) Experiments with discrimination tree indexing and path indexing for term retrieval, J. Automated Reasoning 9(2), 147-167.
Nieuwenhuis, R., Hillenbrand, T., Riazanov, A. and Voronkov, A. (2001) On the evaluation of indexing techniques for theorem proving, in R. Goré, A. Leitsch, and T. Nipkow (eds.), Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR 2001) (Siena, Italy), LNAI 2083, Springer-Verlag, pp. 257-271.
Nieuwenhuis, R., Rivero, J. M. and Vallejo, M. (1997) A kernel of data structures and algorithms for automated deduction with equality clauses (system description), in 14th Int. Conf. on Automated Deduction (CADE) (Australia), Springer-Verlag, pp. 49-53. Long version at www.lsi.upc.es/~roberto.
Riazanov, A. and Voronkov, A. (2000) Partially adaptive code trees, in Proceedings of JELIA 2000 (Malaga, Spain).
Riazanov, A. and Voronkov, A. (2002) The design and implementation of VAMPIRE, AI Communications 15, 91-110.
Sutcliffe, G., Suttner, C. and Yemenis, T. (1994) The TPTP problem library, in A. Bundy (ed.), Proceedings of the 12th International Conference on Automated Deduction (Berlin), LNAI 814, Springer-Verlag, pp. 252-266.
Voronkov, A. (1995) The anatomy of Vampire: Implementing bottom-up procedures with code trees, J. Automated Reasoning 15(2), 237-265.
Weidenbach, C. (1997) SPASS-Version 0.49, J. Automated Reasoning 18(2), 247-252.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ganzinger, H., Nieuwenhuis, R. & Nivela, P. Fast Term Indexing with Coded Context Trees. Journal of Automated Reasoning 32, 103–120 (2004). https://doi.org/10.1023/B:JARS.0000029963.64213.ac
Issue Date:
DOI: https://doi.org/10.1023/B:JARS.0000029963.64213.ac