Partially Adaptive Code Trees
Code trees  is an indexing technique used for implementing several indexed operations on terms in the theorem prover Vampire . 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.
Keywordsautomated theorem proving subsumption matching term indexing code trees
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 4.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.Google Scholar
- 5.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.Google Scholar
- 6.J.M.A. Rivero. Data Structures and Algorithms for Automated Deduction with Equality. Phd thesis, Universitat Politècnica de Catalunya, Barcelona, May 2000.Google Scholar
- 7.G. Sutcliffe. The CADE-16 ATP system competition. Journal of Automated Reasoning, 2000. to appear.Google Scholar