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, also common subterms 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 describe an implementation of context trees based on Curry terms and on an extension of substitution trees with equality constraints, where one also does not distinguish between internal and external variables. Experiments with matching benchmarks show that our preliminary implementation is already 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.
The second and third author are partially supported by the Spanish CICYT project HEMOSS ref. TIC98-0949-C02-01. All test programs, implementations and benchmarks mentioned in this paper are available at www.lsi.upc.es/~roberto.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jim Christian. Flatterms, Discrimination Nets, and Fast Term rewriting. Journal of Automated Reasoning, 10:95–113, 1993.
Peter Graf. Substitution Tree Indexing. In J. Hsiang, editor, 6th RTA, LNCS 914, pages 117–131, Kaiserslautern, Germany, April 4-7, 1995. Springer-Verlag.
Thomas Hillenbrand, Arnim Buch, Roland Vogt, and Bernd Löchner. WALDMEISTER—high-performance equational deduction. Journal of Automated Reasoning, 18(2):265–270, April 1997.
William McCune. Experiments with discrimination tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, October 1992.
Robert Nieuwenhuis, Thomas Hillenbrand, Alexandre Riazanov, and Andrei Voronkov. On the evaluation of indexing data structures. 2001. This proceedings.
Robert Nieuwenhuis, José Miguel Rivero, and Miguel Ángel Vallejo. A kernel of data structures and algorithms for automated deduction with equality clauses (system description). In William McCune, editor, 14th International Conference on Automated Deduction (CADE), LNAI 1249, pages 49–53, Jamestown, Australia, 1997. Springer-Verlag. Long version at http://www.lsi.upc.es/~roberto.
Alexandre Riazanov and Andrei Voronkov. Partially adaptive code trees. In Proceedings of JELIA 2000, Malaga, Spain, 2000.
Geoff Sutcliffe, Christian Suttner, and Theodor Yemenis. The TPTP problem library. In Alan Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, volume 814 of LNAI, pages 252–266, Berlin, June/July 1994. Springer.
Andrei Voronkov. The anatomy of vampire implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237–265, October 1995.
Christoph Weidenbach. SPASS—version 0.49. Journal of Automated Reasoning, 18(2):247–252, April 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H., Nieuwenhuis, R., Nivela, P. (2001). Context Trees. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-45744-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42254-9
Online ISBN: 978-3-540-45744-2
eBook Packages: Springer Book Archive