{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:52Z","timestamp":1725664192869},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580256"},{"type":"electronic","value":"9783540484172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58025-5_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:07:05Z","timestamp":1330268825000},"page":"152-170","source":"Crossref","is-referenced-by-count":2,"title":["Computing cost estimates for proof strategies"],"prefix":"10.1007","author":[{"given":"Knut","family":"Hinkelmann","sequence":"first","affiliation":[]},{"given":"Helge","family":"Hintze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0743-1066(91)90030-S","volume":"11","author":"I. Balbin","year":"1991","unstructured":"[Balbin et al., 1991] I. Balbin, G. S. Port, K. Ramamohanarao, and K. Meenakshi. Efficient bottom-up computation of queries on stratified databases. Journal of Logic Programming, 11:295\u2013344, 1991.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"Francois Bancilhon and Raghu Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proceedings of the ACM SIGMOD Conference, pages 16\u201352. ACM, 1986.","key":"10_CR2","DOI":"10.1145\/16894.16859"},{"key":"10_CR3","first-page":"441","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Bancilhon","year":"1988","unstructured":"Francois Bancilhon and Raghu Ramakrishnan. Performance evaluation of data intensive logic programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 441\u2013517. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1988."},{"doi-asserted-by":"crossref","unstructured":"[Bancilhon et al., 1986] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, pages 1\u201315. ACM, 1986.","key":"10_CR4","DOI":"10.1145\/6012.15399"},{"unstructured":"F. Bancilhon. A note on the performance on rule-based systems. Technical Report DB-022-85, MCC, 1985.","key":"10_CR5"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Catriel Beeri and Raghu Ramakrishnan. On the power of magic. Journal of Logic Programming, 10:255\u2013299, October 1991.","journal-title":"Journal of Logic Programming"},{"key":"10_CR7","volume-title":"Research Report RR-93-08","author":"H. Boley","year":"1993","unstructured":"[Boley et al., 1993] Harold Boley, Philipp Hanschke, Knut Hinkelmann, and Manfred Meyer. COLAB: A hybrid knowledge compilation laboratory. Research Report RR-93-08, DFKI, Kaiserslautern, Germany, January 1993. Also to appear in Annals of Operations Research."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","volume":"5","author":"F. Bry","year":"1990","unstructured":"Francois Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data and Knowledge Engineering, 5:289\u2013312, 1990.","journal-title":"Data and Knowledge Engineering"},{"unstructured":"S. W. Dietrich. Extension tables: Memo relations in logic programming. In SLP-87, 1987.","key":"10_CR9"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science, vol. 649","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-56282-6_4","volume-title":"Meta-Programming in Logic, Uppsala, Sweden, June 1992","author":"J. Komorowski","year":"1992","unstructured":"J. Komorowski. An introduction to partial deduction. In A. Pettorossi, editor, Meta-Programming in Logic, Uppsala, Sweden, June 1992 (Lecture Notes in Computer Science, vol. 649), pages 49\u201369. Berlin: Springer-Verlag, 1992."},{"unstructured":"Thomas Labisch. Developing a combined forward\/backward-chaining system for logic programs in a hybrid expertsystem shell. Master's thesis, Universit\u00e4t Kaiserslautern, June 1993. In German.","key":"10_CR11"},{"unstructured":"Wolfgang Nejdl. Recursive strategies for answering recursive queries \u2014 the RQA\/FQI strategy. In Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 43\u201350, Brighton, 1987.","key":"10_CR12"},{"unstructured":"Nils J Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.","key":"10_CR13"},{"unstructured":"Raghu Ramakrishnan. Magic templates: A spellbinding approach to logic programms. In R.A. Kowalski and K.B. Bowen, editors, Proceedings of the 5th International Conference and Symposium on Logic Programming, 1988.","key":"10_CR14"},{"doi-asserted-by":"crossref","unstructured":"[Rohmer et al., 1986] J. Rohmer, R. Lescoeur, and J. M. Kerisit. The alexander method \u2014 a technique for the processing of recursive axioms in deductive databases. New Generation Computing, pages 273\u2013285, 1986.","key":"10_CR15","DOI":"10.1007\/BF03037407"},{"doi-asserted-by":"crossref","unstructured":"D. Sacca and C. Zaniolo. The generalized counting method for recursive logic queries. In First International Conference on Database Theory, 1986.","key":"10_CR16","DOI":"10.1007\/3-540-17187-8_28"},{"key":"10_CR17","first-page":"505","volume-title":"LNCS 225","author":"H. Tamaki","year":"1986","unstructured":"Hisso Tamaki and Taisuke Sato. OLD resolution with tabulation. In E. Shapiro, editor, Third International Conference on Logic Programming (ICLP), LNCS 225, pages 505\u2013512, London, July 1986. Springer Verlag."},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00247437","volume":"3","author":"R. Treitel","year":"1987","unstructured":"Richard Treitel and Michael R. Genesereth. Choosing directions for rules. Journal of Automated Reasoning, 3:395\u2013431, 1987.","journal-title":"Journal of Automated Reasoning"},{"unstructured":"Richard Treitel. Sequentialization of logic programs. Technical Report STAN-CS-86-1135, Stanford University, Department of Computer Science, November 1986.","key":"10_CR19"},{"unstructured":"Laurent Vieille. Recursive axioms in deductive databases: The query\/subquery approach. In L. Kerschberg, editor, Proceedings of the First International Conference on Expert Database Systems, April 1986.","key":"10_CR20"}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58025-5_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:10:20Z","timestamp":1619572220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58025-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580256","9783540484172"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-58025-5_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}