{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:01:15Z","timestamp":1725476475071},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_21","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T23:27:08Z","timestamp":1167348428000},"page":"342-359","source":"Crossref","is-referenced-by-count":2,"title":["Modular Termination Proofs for Prolog with Tabling"],"prefix":"10.1007","author":[{"given":"Sofie","family":"Verbaeten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"De Schreye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Handbook of theoretical computer science","author":"K. Apt","year":"1990","unstructured":"Apt, K.: Logic programming. In: van Leeuwen, J. (ed.) Handbook of theoretical computer science, vol.\u00a0B, Elsevier Science Publishers, Amsterdam (1990)"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K. Apt","year":"1993","unstructured":"Apt, K., Pedreschi, D.: Reasoning about termination of pure Prolog programs. Information and Computation\u00a0106(1), 109\u2013157 (1993)","journal-title":"Information and Computation"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Apt, K., Pedreschi, D.: Modular termination proofs for logic and pure Prolog programs. Advances in Logic Programming Theory, 183\u2013229 (1994)","DOI":"10.1093\/oso\/9780198538530.003.0004"},{"issue":"l","key":"21_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. J. ACM\u00a043(l), 20\u201374 (1996)","journal-title":"J. ACM"},{"issue":"20","key":"21_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye De","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. Journal of Logic Programming\u00a019(20), 199\u2013260 (1994)","journal-title":"Journal of Logic Programming"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"De Schreye, D., Verschaetse, K., Bruynooghe, M.: A framework for analysing the termination of definite logic programs with respect to call patterns. In: Proc. FGCS 1992, ICOT Tokyo, pp. 481\u2013488 (1992)","DOI":"10.1007\/3-540-56282-6_5"},{"key":"21_CR7","unstructured":"Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint-based automatic termination analysis for logic programs. ACM TO PL AS (To appear)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-49674-2_6","volume-title":"Logic Program Synthesis and Transformation","author":"S. Decorte","year":"1998","unstructured":"Decorte, S., De Schreye, D., Leuschel, M., Martens, B., Sagonas, K.: Termination Analysis for Tabled Logic Programming. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 107\u2013123. Springer, Heidelberg (1998)"},{"issue":"2","key":"21_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Early","year":"1970","unstructured":"Early, J.: An efficient context-free parsing algorithm. CACM\u00a013(2), 94\u2013102 (1970)","journal-title":"CACM"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: Declarative modelling of the operational behaviour of logic languages. Theor. Comp. Sc.\u00a069(3), 289\u2013318 (1989)","journal-title":"Theor. Comp. Sc."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","first-page":"473","volume-title":"Functional Programming Languages and Computer Architecture","author":"C.K. Hoist","year":"1991","unstructured":"Hoist, C.K.: Finiteness Analysis. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 473\u2013495. Springer, Heidelberg (1991)"},{"issue":"1\u20132","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(93)90011-5","volume":"15","author":"T. Kanamori","year":"1993","unstructured":"Kanamori, T., Kawamura, T.: OLDT-based abstract interpretation. Journal of Logic Programming\u00a015(1\u20132), 1\u201330 (1993)","journal-title":"Journal of Logic Programming"},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of logic programming. Springer, Heidelberg (1987)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","volume-title":"Termination Proofs for Logic Programs","author":"L. Pliimer","year":"1990","unstructured":"Pliimer, L.: Termination proofs for logic programs. In: Pl\u00fcmer, L. (ed.) Termination Proofs for Logic Programs. LNCS, vol.\u00a0446, Springer, Heidelberg (1990)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, T.: OLD Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"21_CR16","unstructured":"Verbaeten, S., De Schreye, D.: Termination analysis of tabled logic programs using mode and type information. Technical Report 277, Department of Computer Science, K.U.Leuven., Available at http:\/\/www.cs.kuleuven.ac.be\/~sofie"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Verbaeten, S., Sagonas, K., De Schreye, D.: Modular termination proofs for Prolog with tabling. Technical Report, Department of Computer Science, K.U.Leuven (1999), Available at http:\/\/www.cs.kuleuven.ac.be\/~sofie","DOI":"10.1007\/10704567_21"},{"issue":"l","key":"21_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"Vieille, L.: Recursive query processing: the power of logic. Theor. Comp. Sc.\u00a069(l), 1\u201353 (1989)","journal-title":"Theor. Comp. Sc."},{"key":"21_CR19","unstructured":"Warren, D.S.: Notes for \u2019Programming in Tabled Prolog. Early draft (1998), available at http:\/\/www.cs.sunysb.edu\/~warren\/"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T17:03:12Z","timestamp":1707498192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10704567_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}