Efficient Instance Retrieval with Standard and Relational Path Indexing

  • Alexandre Riazanov
  • Andrei Voronkov
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A., Hopcroft, J., Ullmann, J.: The design and analysis of computer algorithms. Addison Wesley, Reading (1983)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 3.
    Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 117–131. Springer, Heidelberg (1995)Google Scholar
  4. 4.
    Graf, P. (ed.): Term Indexing. LNCS, vol. 1053. Springer, Heidelberg (1996)Google Scholar
  5. 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. 6.
    McCune, W.W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning 9(2), 147–167 (1992)MATHCrossRefMathSciNetGoogle Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 9.
    Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33(6), 668–676 (1990)CrossRefMathSciNetGoogle Scholar
  10. 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. 11.
    Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications 15(2-3), 91–110 (2002)MATHGoogle Scholar
  12. 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. 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)CrossRefGoogle Scholar
  14. 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. 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. 16.
    Voronkov, A.: The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning 15(2), 237–265 (1995)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexandre Riazanov
    • 1
  • Andrei Voronkov
    • 1
  1. 1.University of Manchester 

Personalised recommendations