Skip to main content
SpringerLink
Log in

Partially Adaptive Code Trees

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1919))

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Christian. Flatterms, discrimination nets, and fast term rewriting. Journal of Automated Reasoning, 10(1):95–113, February 1993.

    Article  MathSciNet  Google Scholar 

  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 

  3. William W. McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9(2):147–167, 1992.

    Article  MATH  MathSciNet  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 

  8. A. Voronkov. The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning, 15(2):237–265, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Manchester, England

    Alexandre Riazanov & Andrei Voronkov

Authors
  1. Alexandre Riazanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, E.T.S.I. Informática, University of Málaga, 29071, Málaga, Spain

    Manuel Ojeda-Aciego  & Inma P. de Guzmán  & 

  2. Intelligent Systems Department, Computer Science Institute, University of Leipzig, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Center for Artificial Intelligence, Department of Computer Science, University of Lisbon, 2825-114, Caparica, Portugal

    Luís Moniz Pereira

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation