Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 2003: Automated Deduction – CADE-19 pp 380–396Cite as

Efficient Instance Retrieval with Standard and Relational Path Indexing

  • Conference paper

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

Abstract

Path indexing is a family of indexing techniques that can support instance retrieval, which is the core of any implementation of backward demodulation. We propose a number of powerful optimisations to standard path indexing. We also describe a novel flexible framework, called relational path indexing, that combines path indexing with relational joins. We illustrate the flexibility of relational path indexing by sketching how to adapt the scheme to instance retrieval modulo commutativity and backward subsumption on multi-literal clauses.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Hopcroft, J., Ullmann, J.: The design and analysis of computer algorithms. Addison Wesley, Reading (1983)

    Google Scholar 

  2. Ganzinger, H., Nieuwenhuis, R., Nivela, P.: Context trees. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 242–256. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 117–131. Springer, Heidelberg (1995)

    Google Scholar 

  4. Graf, P. (ed.): Term Indexing. LNCS, vol. 1053. Springer, Heidelberg (1996)

    Google Scholar 

  5. Kapur, D., Narendran, P.: NP-completeness of the Set Unification and Matching Problems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 489–495. Springer, Heidelberg (1986)

    Google Scholar 

  6. McCune, W.W.: 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 

  7. Nieuwenhuis, R., Hillenbrand, T., Riazanov, A., Voronkov, A.: On the evaluation of indexing techniques for theorem proving. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 257–271. Springer, Heidelberg (2001), see also the COMPIT homepage www.mpi-sb.mpg.de/~hillen/compit/

  8. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 7, pp. 371–443. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  9. Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33(6), 668–676 (1990)

    Article  MathSciNet  Google Scholar 

  10. Ramesh, R., Ramakrishnan, I.V., Warren, D.S.: Automata-driven indexing of Prolog clauses. In: Seventh Annual ACM Symposium on Principles of Programming Languages, San Francisco, pp. 281–291 (1990)

    Google Scholar 

  11. Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications 15(2-3), 91–110 (2002)

    MATH  Google Scholar 

  12. Riazanov, A., Voronkov, A.: Efficient instance retrieval with standard and relational path indexing. Preprint CSPP-20, Department of Computer Science, University of Manchester (January 2003)

    Google Scholar 

  13. Sekar, R., Ramakrishnan, I.V., Voronkov, A.: Term indexing. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, ch. 26, pp. 1853–1964. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  14. Stickel, M.: The path indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, Menlo Park, CA (October 1989)

    Google Scholar 

  15. Suttner, C.B., Sutcliffe, G.: The TPTP problem library - v2.1.0. Technical Report JCU-CS-97/8, Department of Computer Science, James Cook University (December 15, 1997)

    Google Scholar 

  16. Voronkov, A.: 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,  

    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. Theoretical Computer Science, TU Dresden, Germany

    Franz Baader

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riazanov, A., Voronkov, A. (2003). Efficient Instance Retrieval with Standard and Relational Path Indexing. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45085-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40559-7

  • Online ISBN: 978-3-540-45085-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation