{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:20Z","timestamp":1725536900228},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_9","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T04:23:01Z","timestamp":1251692581000},"page":"71-86","source":"Crossref","is-referenced-by-count":7,"title":["Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Calimeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanna","family":"Cozza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovambattista","family":"Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"9_CR2","first-page":"1070","volume-title":"ICLP\/SLP\u00a01988","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP\/SLP\u00a01988, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC\u00a09, 365\u2013385 (1991)","journal-title":"NGC"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer Set Planning. In: ICLP 1999, pp. 23\u201337 (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","first-page":"267","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Syrj\u00e4nen","year":"2001","unstructured":"Syrj\u00e4nen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, p. 267. Springer, Heidelberg (2001)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-45619-8_23","volume-title":"Logic Programming","author":"P.A. Bonatti","year":"2002","unstructured":"Bonatti, P.A.: Reasoning with infinite stable models II: Disjunctive programs. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 333\u2013346. Springer, Heidelberg (2002)"},{"issue":"1","key":"9_CR8","first-page":"75","volume":"156","author":"P.A. Bonatti","year":"2004","unstructured":"Bonatti, P.A.: Reasoning with infinite stable models. AI\u00a0156(1), 75\u2013111 (2004)","journal-title":"AI"},{"key":"9_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-540-75560-9_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Simkus","year":"2007","unstructured":"Simkus, M., Eiter, T.: FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 514\u2013530. Springer, Heidelberg (2007)"},{"key":"9_CR10","first-page":"454","volume-title":"KR\u00a02008","author":"F. Lin","year":"2008","unstructured":"Lin, F., Wang, Y.: Answer Set Programming with Functions. In: KR\u00a02008, Sydney, Australia, pp. 454\u2013465. AAAI Press, Menlo Park (2008)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-89982-2_36","volume-title":"Logic Programming","author":"P. Cabalar","year":"2008","unstructured":"Cabalar, P.: Partial Functions and Equality in Answer Set Programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 392\u2013406. Springer, Heidelberg (2008)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"Logic Programming","author":"F. Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"key":"#cr-split#-9_CR13.1","unstructured":"Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. Tech. Report 0901.2850v1, arXiv.org (2009);"},{"key":"#cr-split#-9_CR13.2","unstructured":"To appear in TPLP (TPLP)"},{"issue":"15","key":"9_CR14","first-page":"1833","volume":"172","author":"P.A. Bonatti","year":"2008","unstructured":"Bonatti, P.A.: Erratum to: Reasoning with infinite stable models. AI\u00a0172(15), 1833\u20131835 (2008)","journal-title":"AI"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"key":"9_CR16","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: DLV-Complex, homepage (since 2008), http:\/\/www.mat.unical.it\/dlv-complex"},{"key":"9_CR17","unstructured":"Marano, M., Ianni, G., Ricca, F.: A Magic Set Implementation for Disjunctive Logic Programming with Function Symbols. Submitted to CILC 2009 (2009)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic Sets and Other Strange Ways to Implement Logic Programs. In: PODS 1986, Cambridge, Massachusetts, pp. 1\u201315 (1986)","DOI":"10.1145\/6012.15399"},{"key":"9_CR19","unstructured":"Ullman, J.D.: Principles of Database and Knowledge Base Systems, vol.\u00a02. Computer Science Press (1989)"},{"key":"9_CR20","first-page":"269","volume-title":"PODS 1987","author":"C. Beeri","year":"1987","unstructured":"Beeri, C., Ramakrishnan, R.: On the Power of Magic. In: PODS 1987, pp. 269\u2013284. ACM, New York (1987)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-27775-0_26","volume-title":"Logic Programming","author":"C. Cumbo","year":"2004","unstructured":"Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the magic-set method for disjunctive datalog programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 371\u2013385. Springer, Heidelberg (2004)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"9_CR23","first-page":"23","volume-title":"ICLP 1994","author":"V. Lifschitz","year":"1994","unstructured":"Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23\u201337. MIT Press, Cambridge (1994)"},{"key":"9_CR24","volume-title":"A logical language for data and knowledge bases","author":"S. Naqvi","year":"1989","unstructured":"Naqvi, S., Tsur, S.: A logical language for data and knowledge bases. CS Press, NY (1989)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\/20","author":"D.D. Schreye","year":"1994","unstructured":"Schreye, D.D., Decorte, S.: Termination of Logic Programs: The Never-Ending Story. JLP\u00a019\/20, 199\u2013260 (1994)","journal-title":"JLP"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","volume":"124","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Cocco, N., Fabris, M.: Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science\u00a0124(2), 297\u2013328 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1216374.1216378","volume":"29","author":"M. Bruynooghe","year":"2007","unstructured":"Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM TOPLAS\u00a029(2), 10 (2007)","journal-title":"ACM TOPLAS"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Behrend, A.: Soft stratification for magic set based query evaluation in deductive databases. In: PODS 2003, San Diego, CA, USA, pp. 102\u2013110 (2003)","DOI":"10.1145\/773153.773164"},{"issue":"4","key":"9_CR29","first-page":"584","volume":"73","author":"W. Faber","year":"2007","unstructured":"Faber, W., Greco, G., Leone, N.: Magic Sets and their Application to Data Integration. JCSS\u00a073(4), 584\u2013609 (2007)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04238-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:36:34Z","timestamp":1558499794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}