{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:05Z","timestamp":1747548605053,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1023\/a:1018940713446","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"335-356","source":"Crossref","is-referenced-by-count":0,"title":["State\u2010saving transformations for efficient bottom\u2010up evaluation of logic programs and rule\u2010based systems"],"prefix":"10.1007","volume":"20","author":[{"given":"Knut","family":"Hinkelmann","sequence":"first","affiliation":[]},{"given":"Helge","family":"Hintze","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"325433_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0743-1066(91)90030-S","volume":"11","author":"I. Balbin","year":"1991","unstructured":"I. Balbin, G.S. Port, K. Ramamohanarao and K. Meenakshi, Efficient bottom-up computation of queries on stratified databases, Journal of Logic Programming 11 (1991) 295\u2013344.","journal-title":"Journal of Logic Programming"},{"key":"325433_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","volume":"4","author":"I. Balbin","year":"1987","unstructured":"I. Balbin and K. Ramamohanarao, A generalization of the differential approach to recursive query evaluation, Journal of Logic Programming 4 (1987) 259\u2013262.","journal-title":"Journal of Logic Programming"},{"key":"325433_CR3","doi-asserted-by":"crossref","unstructured":"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 (ACM, 1986) pp. 1\u201315.","DOI":"10.1145\/6012.15399"},{"key":"325433_CR4","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, in: Proceedings of the ACM SIGMOD Conference (ACM, 1986) pp. 16\u201352.","DOI":"10.1145\/16856.16859"},{"key":"325433_CR5","first-page":"441","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Bancilhon","year":"1988","unstructured":"F. Bancilhon and R. Ramakrishnan, Performance evaluation of data intensive logic programs, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann Publishers, Inc., Los Altos, CA, 1988) pp. 441\u2013517."},{"key":"325433_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan, On the power of magic, Journal of Logic Programming 10 (October 1991) 255\u2013299.","journal-title":"Journal of Logic Programming"},{"key":"325433_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02031716","volume":"55","author":"H. Boley","year":"1995","unstructured":"H. Boley, P. Hanschke, K. Hinkelmann and M. Meyer, COLAB: A hybrid knowledge compilation laboratory, Annals of Operations Research 55 (1995) 11\u201379.","journal-title":"Annals of Operations Research"},{"key":"325433_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","volume":"5","author":"F. Bry","year":"1990","unstructured":"F. Bry, Query evaluation in recursive databases: bottom-up and top-down reconciled, Data and Knowledge Engineering 5 (1990) 289\u2013312.","journal-title":"Data and Knowledge Engineering"},{"key":"325433_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C.L. Forgy","year":"1982","unstructured":"C.L. Forgy, Rete: A fast algorithm for the many pattern \/ many object pattern match problem, Artificial Intelligence 19 (1982) 17\u201337.","journal-title":"Artificial Intelligence"},{"key":"325433_CR10","first-page":"357","volume-title":"Proceedings of the International Conference on Fifth Generation Computer Systems","author":"M. Fujita","year":"1992","unstructured":"M. Fujita, R. Hasegawa, M. Koshimura and H. Fujita, Model generation theorem provers on a parallel inference machine, in: Proceedings of the International Conference on Fifth Generation Computer Systems (Association for Computing Machinery, ICOT, Japan, 1992) pp. 357\u2013375."},{"key":"325433_CR11","unstructured":"K. Hinkelmann, A consequence-finding approach for feature recognition in CAPP, in: Seventh International Conference on Industrial & Engineering Applications of Artifical Intelligence & Expert Systems (IEA\/AIE'94), Austin, Texas (Gordon and Breach Science Publishers, 1994) pp. 2\u201311."},{"key":"325433_CR12","unstructured":"K. Hinkelmann, Knowledge-base rewriting for bottom-up abduction and integrity checking, in: Deductive Databases and Logic Programming \u2014 Abduction in Deductive Databases and Knowledge-based Systems, Proceedings of the ICLP'95 Joint Workshop, eds. H. Decker, U. Geske, T. Kakas, C. Sakama, D. Seipel and T. Urpi, GMD-Studien Nr. 266 (June 1995) pp. 127\u2013141."},{"key":"325433_CR13","unstructured":"K. Hinkelmann, Transformation von Hornklausel-Wissensbasen: Verarbeilung gleichen Wissens durch verschiedene Inferenzen, Dissertationen zur K\u00fcnstlichen Intelligenz, Band 81, infix, St. Augustin (1995). PhD Thesis, in German."},{"key":"325433_CR14","unstructured":"K. Inoue, Consequence-finding based on ordered linear resolution, in: Proc. of the 12th IJCAI, Sidney, Australia (1991)."},{"key":"325433_CR15","unstructured":"K. Inoue, Y. Ohta, R. Hasegawa and M. Nakashima, Bottom-up abduction by model generation, in: Proc. of the 13th IJCAI (1993) pp. 102\u2013108."},{"key":"325433_CR16","unstructured":"R. Krishnamurthy, H. Boral and C. Zaniolo, Optimization of nonrecursive queries, in: Proceedings of the 12th International Conference on Very Large Databases (VLDB) (1986) pp. 128\u2013137."},{"key":"325433_CR17","unstructured":"D.P. Miranker, TREAT: A better match algorithm for AI production systems, in: Proc. of AAAI-87 (Philadelphia, PA, 1987) pp. 42\u201347. Extended Version as Technical Report AI TR87-58, University of Texas at Austin."},{"key":"325433_CR18","doi-asserted-by":"crossref","unstructured":"K.A. Morris, An algorithm for ordering subgoals in NAIL!, in: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'88) (ACM Press, 1988).","DOI":"10.1145\/308386.308419"},{"key":"325433_CR19","unstructured":"P. Nayak, A. Gupta and P. Rosenbloom, Comparison of the Rete and Treat production matchers for Soar (a summary), in: Proc. of AAAI-88 (St. Paul, MN, 1988) pp. 693\u2013698."},{"key":"325433_CR20","unstructured":"R. Ramakrishnan, Magic templates: A spellbinding approach to logic programms, in: Proceedings of the 5th International Conference and Symposium on Logic Programming, eds. R.A. Kowalski and K.B. Bowen (1988)."},{"key":"325433_CR21","doi-asserted-by":"crossref","unstructured":"J. Rohmer, R. Lescoeur and J.M. Kerisit, The Alexander method \u2014 a technique for the processing of recursive axioms in deductive databases, in: New Generation Computing (1986) pp. 273\u2013285.","DOI":"10.1007\/BF03037407"},{"key":"325433_CR22","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).","DOI":"10.1007\/3-540-17187-8_28"},{"key":"325433_CR23","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/B978-0-934613-40-8.50013-0","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Sadri","year":"1988","unstructured":"F. Sadri and R. Kowalski, A theorem-proving approach to database integrity, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann Publishers, Inc., Los Altos, CA, 1988) pp. 313\u2013362."},{"key":"325433_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0004-3702(85)90028-1","volume":"26","author":"D.E. Smith","year":"1985","unstructured":"D.E. Smith and M.R. Genesereth, Ordering conjunctive queries, Artificial Intelligence 26 (1985) 171\u2013215.","journal-title":"Artificial Intelligence"},{"key":"325433_CR25","doi-asserted-by":"crossref","unstructured":"M.E. Stickel, Upside-down meta-interpretation for the model-elimination theorem-proving procedure for deduction and abduction, Technical Report TR-664, ICOT (July 1991).","DOI":"10.21236\/ADA259436"},{"key":"325433_CR26","unstructured":"H. Tamaki and T. Sato, Unfold\/fold transformations of logic programs, in: Proceedings of the Second International Conference on Logic Programming (Uppsala, 1984) pp. 127\u2013138."},{"key":"325433_CR27","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J.D. Ullman","year":"1989","unstructured":"J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 2 (Computer Science Press, Rockville, Maryland USA, 1989)."},{"key":"325433_CR28","doi-asserted-by":"crossref","unstructured":"J.D. Ullman and M.Y. Vardi, The complexity of ordering subgoals, in: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'88) (ACM Press, 1988).","DOI":"10.1145\/308386.308417"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018940713446.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018940713446\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018940713446.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:35:29Z","timestamp":1747546529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018940713446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":28,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["325433"],"URL":"https:\/\/doi.org\/10.1023\/a:1018940713446","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}