{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:54:28Z","timestamp":1725562468886},"publisher-location":"Berlin, Heidelberg","reference-count":83,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_14","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"453-498","source":"Crossref","is-referenced-by-count":10,"title":["Proving Termination for Logic Programs by the Query-Mapping Pairs Approach"],"prefix":"10.1007","author":[{"given":"Naomi","family":"Lindenstrauss","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Serebrenik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1997)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Bezem, M.: Acyclic Programs. New Generation Computing\u00a09, 335\u2013363 (1991)","journal-title":"New Generation Computing"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-60043-4_47","volume-title":"Algebraic Methodology and Software Technology","author":"K.R. Apt","year":"1995","unstructured":"Apt, K.R., Luitjes, I.: Verification of logic programs with delay declarations. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, pp. 66\u201390. Springer, Heidelberg (1995)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about Termination of Pure Prolog Programs. Information and Computation\u00a0106, 109\u2013157 (1993)","journal-title":"Information and Computation"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/oso\/9780198538530.003.0004","volume-title":"Advances in Logic Programming Theory","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Pedreschi, D.: Modular Termination Proofs for Logic and Pure Prolog Programs. In: Advances in Logic Programming Theory, pp. 183\u2013229. Oxford University Press, Oxford (1994)"},{"key":"14_CR6","unstructured":"Arts, T.: Automatically proving termination and innermost normalisation of term rewriting systems. PhD thesis, Universiteit Utrecht (1997)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(92)90045-5","volume":"14","author":"M. Baudinet","year":"1992","unstructured":"Baudinet, M.: Proving termination properties of Prolog programs: a semantic approach. Journal of Logic Programming\u00a014, 1\u201329 (1992)","journal-title":"Journal of Logic Programming"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-62718-9_12","volume-title":"Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1997","unstructured":"Benoy, F., King, A.: Inferring argument size relationships with CLPR(R). In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 204\u2013223. Springer, Heidelberg (1997)"},{"key":"14_CR10","volume-title":"Geometric Nonlinear Functional Analysis","author":"Y. Benyamini","year":"2000","unstructured":"Benyamini, Y., Lindenstrauss, J.: Geometric Nonlinear Functional Analysis, vol.\u00a01&48. AMS Colloquium Publications, Providence (2000)"},{"key":"14_CR11","first-page":"69","volume-title":"Logic Programming, Proceedings of the North American Conference 1989","author":"M. Bezem","year":"1989","unstructured":"Bezem, M.: Characterizing termination of logic programs with level mappings. In: Lusk, E.L., Overbeek, R.A. (eds.) Logic Programming, Proceedings of the North American Conference 1989, pp. 69\u201380. MIT Press, Cambridge (1989)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","volume":"15","author":"M. Bezem","year":"1993","unstructured":"Bezem, M.: Strong termination of logic programs. J. Logic Programming\u00a015, 79\u201397 (1993)","journal-title":"J. Logic Programming"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-18170-9_152","volume-title":"Computation Theory and Logic","author":"E. B\u00f6rger","year":"1987","unstructured":"B\u00f6rger, E.: Unsolvable decision problems for Prolog programs. In: B\u00f6rger, E. (ed.) Computation Theory and Logic. LNCS, vol.\u00a0270, pp. 37\u201348. Springer, Heidelberg (1987)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S1471068402001382","volume":"2","author":"A. Bossi","year":"2002","unstructured":"Bossi, A., Cocco, N., Etalle, S., Rossi, S.: On modular termination proofs of general logic programs. Theory and Practice of Logic Programming\u00a02(3), 263\u2013291 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19\/20","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabrielli, M., Levi, G., Martelli, M.: The s-semantics approach: theory and Applications. J. Logic Programming\u00a019\/20, 149\u2013198 (1994)","journal-title":"J. Logic Programming"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Sagiv, Y.: Inference of monotonicity constraints in Datalog programs. In: Proceedings of the Eighth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, pp. 190\u2013199 (1989)","DOI":"10.1145\/73721.73741"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Sagiv, Y.: Inference of inequality constraints in logic programs. In: Proceedings of the Tenth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, pp. 227\u2013240 (1991)","DOI":"10.1145\/113413.113434"},{"key":"14_CR18","first-page":"320","volume-title":"International Symposium on Logic Programming","author":"F. Bueno","year":"1994","unstructured":"Bueno, F., Garc\u00eda de la Banda, M., Hermenegildo, M.: Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. In: International Symposium on Logic Programming, pp. 320\u2013336. MIT Press, Cambridge (1994)"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0743-1066(96)00143-4","volume":"32","author":"M. Codish","year":"1997","unstructured":"Codish, M., Bruynooghe, M., Garc\u00b4\u0131a de la Banda, M.J., Hermenegildo, M.V.: Exploiting Goal Independence in the Analysis of Logic Programs. Journal of Logic Programming\u00a032(3), 247\u2013262 (1997)","journal-title":"Journal of Logic Programming"},{"key":"14_CR20","unstructured":"Codish, M., Demoen, B.: Analyzing Logic Programs using \u201cProp\u201d-ositional Logic Programs and a Magic Wand. In: Proceedings International Logic Programming Symposium, Vancouver (1993)"},{"key":"14_CR21","unstructured":"Codish, M., Demoen, B.: Collection of benchmarks"},{"key":"14_CR22","unstructured":"Codish, M., Genaim, S., Bruynooghe, M., Gallagher, J., Vanhoof, W.: One Loop at a Time. In: 6th International Workshop on Termination (2003)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Codish, M., Taboch, C.: A semantic basis for termination analysis of logic programs. Journal of Logic Programming\u00a041(1), 103\u2013123","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Logic Programming\u00a013, 103\u2013179 (1992)","journal-title":"J. Logic Programming"},{"key":"14_CR25","volume-title":"Logic Programming: Proceedings of the 1993 International Symposium","author":"S. Decorte","year":"1993","unstructured":"Decorte, S., De Schreye, D.: Automatic Inference of Norms: a Missing Link in Automatic Termination Analysis. In: Miller, D. (ed.) Logic Programming: Proceedings of the 1993 International Symposium, MIT Press, Cambridge (1993)"},{"key":"14_CR26","volume-title":"Proceedings of the 1997 International Conference on Logic Programming","author":"S. Decorte","year":"1997","unstructured":"Decorte, S., De Schreye, D.: Demand-driven and constraint-based automatic left-termination analysis for Logic Programs. In: Proceedings of the 1997 International Conference on Logic Programming, MIT Press, Cambridge (1997)"},{"issue":"6","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1145\/330643.330645","volume":"21","author":"D. Decorte","year":"1999","unstructured":"Decorte, D., De Schreye, D., Vandecasteele, H.: Constraint-based termination analysis of logic programs. ACM TOPLAS\u00a021(6), 1137\u20131195 (1999)","journal-title":"ACM TOPLAS"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science\u00a017, 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002000100065","volume":"12","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing\u00a012, 1\u20132 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\/20","author":"D. Schreye De","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of Logic Programs: the Never-Ending Story. J. Logic Programming\u00a019\/20, 199\u2013260 (1994)","journal-title":"J. Logic Programming"},{"key":"14_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-45628-7_9","volume-title":"Computational Logic: Logic Programming and Beyond","author":"D. Schreye De","year":"2002","unstructured":"De Schreye, D., Serebrenik, A.: Acceptability with general orderings. Computational Logic. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02407, pp. 187\u2013210. Springer, Heidelberg (2002)"},{"key":"14_CR32","first-page":"481","volume-title":"Proc. of the Int. Conf. on Fifth Generation Computer Systems","author":"D. Schreye De","year":"1992","unstructured":"De Schreye, D., Verschaetse, K., Bruynooghe, M.: A framework for analyzing the termination of definite logic programs with respect to call patterns. In: Proc. of the Int. Conf. on Fifth Generation Computer Systems, pp. 481\u2013488. IOS Press, Amsterdam (1992)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-56503-5_7","volume-title":"STACS 93","author":"P. Devienne","year":"1993","unstructured":"Devienne, P., Leb\u00e8gue, P., Routier, J.C.: Halting problem of one binary Horn clause is undecidable. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 48\u201357. Springer, Heidelberg (1993)"},{"key":"14_CR34","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., Palamidessi, C.: Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science\u00a069, 289\u2013318 (1989)","journal-title":"Theoretical Computer Science"},{"key":"14_CR35","unstructured":"Fischer, J.: Termination analysis for Mercury using convex constraints. Master\u2019s thesis, University of Melbourne, Department of Computer Science and Software Engineering (2002)"},{"issue":"1","key":"14_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(97)10002-4","volume":"35","author":"M.J. Garc\u00eda de la Banda","year":"1998","unstructured":"Garc\u00eda de la Banda, M.J., Mariott, K., Stuckey, P., S\u00f8ndergaard, H.: Differential methods in logic programming analysis. Journal of Logic Programming\u00a035(1), 1\u201338 (1998)","journal-title":"Journal of Logic Programming"},{"key":"14_CR37","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-45653-8_47","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring termination conditions for logic programs using backwards analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 685\u2013694. Springer, Heidelberg (2001)"},{"key":"14_CR38","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-44404-1_23","volume-title":"Logic for Programming and Automated Reasoning","author":"R. Gori","year":"2000","unstructured":"Gori, R.: An abstract interpretation approach to termination of logic programs. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 362\u2013380. 1955, Heidelberg (2000)"},{"key":"14_CR39","series-title":"Regional conference series in mathematics","volume-title":"Rudiments of Ramsey theory","author":"R.L. Graham","year":"1980","unstructured":"Graham, R.L.: Rudiments of Ramsey theory. Regional conference series in mathematics, vol.\u00a045. American Mathematical Society, Providence (1980)"},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(97)00028-9","volume":"34","author":"M. Krishna Rao","year":"1998","unstructured":"Krishna Rao, M., Kapur, D., Shyamansundar, R.: Transformational methology for proving termination of logic programs. Journal of Logic Programming\u00a034, 1\u201341 (1998)","journal-title":"Journal of Logic Programming"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The Size-Change Principle for Program Termination. In: ACM Symposium on Principles of Programming Languages 2001, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"key":"14_CR42","unstructured":"Lindenstrauss, N.: Homepage, http:\/\/www.cs.huji.ac.il\/~naomil"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Lindenstrauss, N., Sagiv, Y.: Checking Termination of Queries to Logic Programs (1996), http:\/\/www.cs.huji.ac.il\/~~naomil\/","DOI":"10.1007\/3-540-63166-6_44"},{"key":"14_CR44","first-page":"63","volume-title":"Proceedings of the 14th International Conference on Logic Programming","author":"N. Lindenstrauss","year":"1997","unstructured":"Lindenstrauss, N., Sagiv, Y.: Automatic Termination Analysis of Logic Programs. In: Naish, L. (ed.) Proceedings of the 14th International Conference on Logic Programming, pp. 63\u201377. MIT Press, Cambridge (1997)"},{"key":"14_CR45","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic Termination Analysis of Logic Programs \u2014 version with Appendix. http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"N. Lindenstrauss, Y. Sagiv and A. Serebrenik. TermiLog: A System for Checking Termination of Queries to Logic Programs. In Computer Aided Verification, 9th International Conference, ed. O. Grumbach, LNCS 1254, 63\u201377, Springer Verlag, 1997.","DOI":"10.1007\/3-540-63166-6_44"},{"key":"14_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-49674-2_11","volume-title":"Logic Program Synthesis and Transformation","author":"N. Lindenstrauss","year":"1998","unstructured":"Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: Unfolding the Mystery of Mergesort. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 206\u2013225. Springer, Heidelberg (1998)"},{"key":"14_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BFb0014328","volume-title":"Algebraic Methodology and Software Technology","author":"M. Marchiori","year":"1996","unstructured":"Marchiori, M.: Proving existential termination of normal logic programs. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101, pp. 375\u2013390. Springer, Heidelberg (1996)"},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Mesnard, F., Bagnara, R.: cTI: A constraint-based termination inference tool for ISO-Prolog. In: TPLP (2004) (to appear)","DOI":"10.1017\/S1471068404002017"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying static analysis techniques for inferring termination conditions of logic programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"},{"issue":"2","key":"14_CR52","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/635499.635503","volume":"4","author":"F. Mesnard","year":"2003","unstructured":"Mesnard, F., Ruggieri, S.: On proving left termination of constraint logic programs. ACM Transactions on Computational Logic\u00a04(2), 207\u2013259 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2","key":"14_CR53","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0743-1066(98)10022-5","volume":"38","author":"K. Muthukumar","year":"1999","unstructured":"Muthukumar, K., Bueno, F., Garc\u00b4\u0131a de la Banda, M.J., Hermenegildo, M.V.: Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism. Journal of Logic Programming\u00a038(2), 165\u2013218 (1999)","journal-title":"Journal of Logic Programming"},{"key":"14_CR54","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Company (1980)"},{"key":"14_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/10721975_20","volume-title":"Rewriting Techniques and Applications","author":"E. Ohlebusch","year":"2000","unstructured":"Ohlebusch, E., Claves, C., March\u00e9, C.: TALP: A tool for the termination analysis of logic programs. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 270\u2013273. Springer, Heidelberg (2000)"},{"key":"14_CR56","volume-title":"The Craft of Prolog","author":"R.A. O\u2019Keefe","year":"1990","unstructured":"O\u2019Keefe, R.A.: The Craft of Prolog. MIT Press, Cambridge (1990)"},{"issue":"3","key":"14_CR57","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1471068402001400","volume":"2","author":"D. Pedreschi","year":"2002","unstructured":"Pedreschi, D., Ruggieri, S., Smaus, J.-G.: Classes of terminating logic programs. Theory and Practice of Logic Programming\u00a02(3), 369\u2013418 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"14_CR58","series-title":"LNAI","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","volume-title":"Termination Proofs for Logic Programs","author":"L. Pl\u00fcmer","year":"1990","unstructured":"Pl\u00fcmer, L.: Termination Proofs for Logic Programs. LNCS (LNAI), vol.\u00a0446. Springer, Heidelberg (1990)"},{"key":"14_CR59","volume-title":"International Logic Programming Symposium","author":"L. Pl\u00fcmer","year":"1991","unstructured":"Pl\u00fcmer, L.: Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms. In: International Logic Programming Symposium, MIT Press, Cambridge (1991)"},{"key":"14_CR60","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Bancilhon, F., Silberschatz, A.: Safety of recursive Horn clauses with infinite relations. In: Proceedings of the ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (1987)","DOI":"10.1145\/28659.28694"},{"key":"14_CR61","first-page":"313","volume-title":"Logic Programming, Proceedings of the North American Conference","author":"B. Ramkumar","year":"1989","unstructured":"Ramkumar, B., Kal\u00e9, L.V.: Compiled execution of the reduce-OR process model on multiprocessors. In: Lusk, E.L., Overbeek, R.A. (eds.) Logic Programming, Proceedings of the North American Conference, pp. 313\u2013331. MIT Press, Cambridge (1989)"},{"key":"14_CR62","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1928","unstructured":"Ramsey, F.P.: On a Problem of Formal Logic. Proc. of London Math. Soc.\u00a030, 264\u2013286 (1928)","journal-title":"Proc. of London Math. Soc."},{"key":"14_CR63","first-page":"187","volume-title":"Proceedings of the 1984 International Conference on Logic Programming","author":"U.S. Reddy","year":"1984","unstructured":"Reddy, U.S.: Transformation of logic programs into functional programs. In: Proceedings of the 1984 International Conference on Logic Programming, pp. 187\u2013196. IEEE-CS, Los Alamitos (1984)"},{"issue":"1-2","key":"14_CR64","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00067-9","volume":"46","author":"S. Ruggieri","year":"2000","unstructured":"Ruggieri, S.: Decidability of logic program semantics and application to testing. Journal of Logic Programming\u00a046(1-2), 103\u2013137 (2000)","journal-title":"Journal of Logic Programming"},{"issue":"1-2","key":"14_CR65","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(99)00155-3","volume":"254","author":"S. Ruggieri","year":"2001","unstructured":"Ruggieri, S.: \u2203-universal termination of logic programs. Theoretical Computer Science\u00a0254(1-2), 273\u2013296 (2001)","journal-title":"Theoretical Computer Science"},{"key":"14_CR66","volume-title":"International Logic Programming Symposium","author":"Y. Sagiv","year":"1991","unstructured":"Sagiv, Y.: A termination test for logic programs. In: International Logic Programming Symposium, MIT Press, Cambridge (1991)"},{"key":"14_CR67","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/109625.109635","volume-title":"Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP)","author":"V. Santos Costa","year":"1991","unstructured":"Santos Costa, V., Warren, D.H.D., Yang, R.: Andorra-I: A parallel Prolog system that transparently exploits both And- and Or-parallelism. In: Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), pp. 83\u201393. ACM Press, New York (1991)"},{"key":"14_CR68","unstructured":"SICStus Prolog User\u2019s Manual. Swedish Institute of Computer Science"},{"key":"14_CR69","unstructured":"Smaus, J.-G.: Modes and Types in Logic Programming. PhD thesis,University of Kent at Canterbury (1999)"},{"key":"14_CR70","first-page":"335","volume-title":"Proceedings of the International Conference on Logic Programming","author":"J.-G. Smaus","year":"1999","unstructured":"Smaus, J.-G.: Proving termination of input-consuming logic programs. In: De Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming, pp. 335\u2013349. MIT Press, Cambridge (1999)"},{"key":"14_CR71","doi-asserted-by":"crossref","unstructured":"Sohn, K., Van Gelder, A.: Termination Detection in Logic Programs using Argument Sizes. In: Proceedings of the Tenth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, pp. 216\u2013226 (1991)","DOI":"10.1145\/113413.113433"},{"key":"14_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BFb0032740","volume-title":"Static Analysis","author":"C. Speirs","year":"1997","unstructured":"Speirs, C., Somogyi, Z., S\u00f8ndergaard, H.: Termination Analysis for Mercury. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 157\u2013171. Springer, Heidelberg (1997)"},{"key":"14_CR73","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1986","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1986)"},{"key":"14_CR74","unstructured":"TermiLog, http:\/\/www.cs.huji.ac.il\/~naomil\/termilog.php"},{"key":"14_CR75","unstructured":"Tick, E., Banerjee, C.: Performance evaluation of Monaco compiler and runtime kernel. In: Warren, D.S. (ed.) Proceedings of the Tenth International Conference on Logic Programming, pp. 757\u2013773 (1993)"},{"issue":"2","key":"14_CR76","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"Ullman, J.D., Van Gelder, A.: Efficient tests for top-down termination of logical rules. JACM\u00a035(2), 345\u2013373 (1988)","journal-title":"JACM"},{"key":"14_CR77","unstructured":"Van Emden, M.H.: An Interpretation Algorithm for Prolog Programs. In: Campbell, J.A. (ed.) Implementations of Prolog (1984)"},{"key":"14_CR78","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01530930","volume":"3","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A.: Deriving constraints among argument sizes in logic programs. Annals of Mathematics and Artificial Intelligence\u00a03, 361\u2013392 (1991)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"14_CR79","unstructured":"Van Gelder, A.: Personal communication"},{"key":"14_CR80","unstructured":"Vasak, T., Potter, J.: Characterisation of terminating logic programs. In: Proceedings of the 1986 Symposium on Logic Programming, pp. 140\u2013147 (1986)"},{"key":"14_CR81","unstructured":"Verschaetse, K.: Static termination analysis for definite Horn clause programs. PhD thesis, Department of Computer Science, K. U. Leuven, Belgium (1992)"},{"key":"14_CR82","doi-asserted-by":"crossref","unstructured":"Verschaetse, K., Decorte, S., De Schreye, D.: Automatic Termination Analysis. In: LOPSTR, pp. 168\u2013183 (1992)","DOI":"10.1007\/978-1-4471-3560-9_12"},{"key":"14_CR83","unstructured":"Verschaetse, K., De Schreye, D.: Deriving Termination Proofs for Logic Programs, using Abstract Procedures. In: Proc. of the 8th ICLP, pp. 301\u2013315 (1991)"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T01:17:50Z","timestamp":1711675070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}