Abstract
Code trees [8] is an indexing technique used for implementing several indexed operations on terms in the theorem prover Vampire [5]. Code trees offer greater flexibility than discrimination trees. In this paper we review a new, considerably faster, version of code trees based on a different representation of the query term. We also introduce a partially adaptive version of code trees.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Christian. Flatterms, discrimination nets, and fast term rewriting. Journal of Automated Reasoning, 10(1):95–113, February 1993.
P. Graf. Substitution tree indexing. In J. Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 117–131, 1995.
William W. McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, 1992.
I.V. Ramakrishnan, R. Sekar, and A. Voronkov. Term indexing. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science and MIT Press, 2000. To appear.
A. Riazanov and A. Voronkov. Vampire. In H. Ganzinger, editor, Automated Deduction—CADE-16. 16th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, pages 292–296, Trento, Italy, July 1999.
J.M.A. Rivero. Data Structures and Algorithms for Automated Deduction with Equality. Phd thesis, Universitat Politècnica de Catalunya, Barcelona, May 2000.
G. Sutcliffe. The CADE-16 ATP system competition. Journal of Automated Reasoning, 2000. to appear.
A. Voronkov. The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237–265, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riazanov, A., Voronkov, A. (2000). Partially Adaptive Code Trees. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Moniz Pereira, L. (eds) Logics in Artificial Intelligence. JELIA 2000. Lecture Notes in Computer Science(), vol 1919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40006-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-40006-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41131-4
Online ISBN: 978-3-540-40006-6
eBook Packages: Springer Book Archive