{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:28Z","timestamp":1725568168871},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_34","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T09:13:30Z","timestamp":1288084410000},"page":"380-396","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Instance Retrieval with Standard and Relational Path Indexing"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Riazanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. Aho","year":"1983","unstructured":"Aho, A., Hopcroft, J., Ullmann, J.: The design and analysis of computer algorithms. Addison Wesley, Reading (1983)"},{"key":"34_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45744-5_18","volume-title":"Automated Reasoning","author":"H. Ganzinger","year":"2001","unstructured":"Ganzinger, H., Nieuwenhuis, R., Nivela, P.: Context trees. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 242\u2013256. Springer, Heidelberg (2001)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-59200-8_52","volume-title":"Rewriting Techniques and Applications","author":"P. Graf","year":"1995","unstructured":"Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 117\u2013131. Springer, Heidelberg (1995)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Term Indexing","year":"1996","unstructured":"Graf, P. (ed.): Term Indexing. LNCS, vol.\u00a01053. Springer, Heidelberg (1996)"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/3-540-16780-3_113","volume-title":"8th International Conference on Automated Deduction","author":"D. Kapur","year":"1986","unstructured":"Kapur, D., Narendran, P.: NP-completeness of the Set Unification and Matching Problems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 489\u2013495. Springer, Heidelberg (1986)"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF00245458","volume":"9","author":"W.W. McCune","year":"1992","unstructured":"McCune, W.W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning\u00a09(2), 147\u2013167 (1992)","journal-title":"Journal of Automated Reasoning"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Hillenbrand, T., Riazanov, A., Voronkov, A.: On the evaluation of indexing techniques for theorem proving. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 257\u2013271. Springer, Heidelberg (2001), see also the COMPIT homepage www.mpi-sb.mpg.de\/~hillen\/compit\/","DOI":"10.1007\/3-540-45744-5_19"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/B978-044450813-3\/50009-6","volume-title":"Handbook of Automated Reasoning","author":"R. Nieuwenhuis","year":"2001","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, ch. 7, pp. 371\u2013443. Elsevier Science, Amsterdam (2001)"},{"issue":"6","key":"34_CR9","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013291 (1990)","DOI":"10.1145\/96709.96738"},{"issue":"2-3","key":"34_CR11","first-page":"91","volume":"15","author":"A. Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications\u00a015(2-3), 91\u2013110 (2002)","journal-title":"AI Communications"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-540-45085-6_34"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1016\/B978-044450813-3\/50028-X","volume-title":"Handbook of Automated Reasoning","author":"R. Sekar","year":"2001","unstructured":"Sekar, R., Ramakrishnan, I.V., Voronkov, A.: Term indexing. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0II, ch. 26, pp. 1853\u20131964. Elsevier Science, Amsterdam (2001)"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Stickel, M.: The path indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, Menlo Park, CA (October 1989)","DOI":"10.21236\/ADA460990"},{"key":"34_CR15","unstructured":"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)"},{"issue":"2","key":"34_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00881918","volume":"15","author":"A. Voronkov","year":"1995","unstructured":"Voronkov, A.: The anatomy of Vampire: Implementing bottom-up procedures with code trees. Journal of Automated Reasoning\u00a015(2), 237\u2013265 (1995)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T18:12:22Z","timestamp":1559758342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}