{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:40Z","timestamp":1725488860986},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442356"},{"type":"electronic","value":"9783540457893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45789-5_35","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T13:50:10Z","timestamp":1186840210000},"page":"509-525","source":"Crossref","is-referenced-by-count":4,"title":["Detecting Optimal Termination Conditions of Logic Programs"],"prefix":"10.1007","author":[{"given":"Fred","family":"Mesnard","sequence":"first","affiliation":[]},{"given":"Etienne","family":"Payet","sequence":"additional","affiliation":[]},{"given":"Ulrich","family":"Neumerkel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"35_CR1","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183\u2013229. Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198538530.003.0004"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. R. Apt","year":"1982","unstructured":"K. R. Apt and M. H. Van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841\u2013862, 1982.","journal-title":"Journal of the ACM"},{"key":"35_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Logic Program Synthesis and Transformation","author":"T. Arts","year":"1996","unstructured":"T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996."},{"key":"35_CR5","series-title":"PhD thesis","volume-title":"Loop Checking in Logic Programming","author":"R. Bol","year":"1991","unstructured":"R. Bol. Loop Checking in Logic Programming. PhD thesis, CWI, Amsterdam, 1991."},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF03037527","volume":"11","author":"M. Bruynooghe","year":"1992","unstructured":"M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47\u201379, 1992.","journal-title":"New Generation Computing"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1):103\u2013123, 1999.","journal-title":"Journal of Logic Programming"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0004-3702(89)90012-X","volume":"41","author":"D. Schreye De","year":"1989","unstructured":"D. De Schreye, M. Bruynooghe, and K. Verschaetse. On the existence of non-terminating queries for a restricted class of Prolog-clauses. Artificial Intelligence, 41:237\u2013248, 1989.","journal-title":"Artificial Intelligence"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 19\u201320:199\u2013260, 1994.","journal-title":"Journal of Logic Programming"},{"issue":"1\/2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002000100065","volume":"12","author":"N. Dershowitz","year":"2001","unstructured":"N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering,Communication and Computing, 12(1\/2):117\u2013156, 2001.","journal-title":"Applicable Algebra in Engineering,Communication and Computing"},{"key":"35_CR11","first-page":"48","volume":"665","author":"P. Devienne","year":"1993","unstructured":"P. Devienne, P. Leb\u00e9gue, and J-C. Routier. Halting problem of one binary Horn clause is undecidable. In LNCS, volume 665, pages 48\u201357. Springer-Verlag, 1993. Proc. of STACS\u201993.","journal-title":"LNCS"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"M. Gabbrielli and R. Giacobazzi. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the ACM Symposium on applied computing, pages 394\u2013399. ACM Press, 1994.","DOI":"10.1145\/326619.326789"},{"key":"35_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Logic for Programming, Artificial intelligence and Reasoning","author":"S. Genaim","year":"2001","unstructured":"S. Genaim and M. Codish. Inferring termination condition for logic programs using backwards analysis. In Proceedings of Logic for Programming, Artificial intelligence and Reasoning, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001. TerminWeb can be used online from http:\/\/www.cs.bgu.ac.il~codish ."},{"issue":"6","key":"35_CR14","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1093\/logcom\/7.6.753","volume":"7","author":"R. Gori","year":"1997","unstructured":"R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6):753\u2013776, 1997.","journal-title":"Journal of Logic and Computation"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"H. J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of Prolog. In Proc. of the 9th POPL, pages 255\u2013267, 1982.","DOI":"10.1145\/582153.582181"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"N. Lindenstrauss. TermiLog: a system for checking termination of queries to logic programs, 1997. http:\/\/www.cs.huji.ac.il\u00f1aomil .","DOI":"10.1007\/3-540-63166-6_44"},{"key":"35_CR17","unstructured":"F. Mesnard. Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In M. J. Maher, editor, Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pages 7\u201321. MIT Press, 1996."},{"key":"35_CR18","unstructured":"F. Mesnard and U. Neumerkel. cTI: a tool for inferring termination conditions of ISO-Prolog, april 2000. http:\/\/www.complang.tuwien.ac.at\/cti."},{"key":"35_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis Symposium","author":"F. Mesnard","year":"2001","unstructured":"F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Static Analysis Symposium, volume 2126 of Lecture Notes in Computer Science, pages 93\u2013110. Springer-Verlag, Berlin, 2001."},{"key":"35_CR20","unstructured":"R. O\u2019Keefe. The Craft Of Prolog. MIT Press, 1990."},{"key":"35_CR21","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":"L. Pl\u00fcmer. Termination proofs for logic programs. Number 446 in LNAI. Springer-Verlag, Berlin, 1990."},{"issue":"1\u20132","key":"35_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0304-3975(00)00197-3","volume":"266","author":"Y.-D. Shen","year":"2001","unstructured":"Y-D. Shen, L-Y. Yuan, and J-H. You. Loops checks for logic programs with functions. Theoretical Computer Science, 266(1\u20132):441\u2013461, 2001.","journal-title":"Theoretical Computer Science"},{"key":"35_CR23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-1997-31207","volume":"31","author":"D. Skordev","year":"1997","unstructured":"D. Skordev. An abstract approach to some loop detection problems. Fundamenta Informaticae, 31:195\u2013212, 1997.","journal-title":"Fundamenta Informaticae"},{"key":"35_CR24","series-title":"Lect Notes Comput Sci","first-page":"160","volume-title":"Proc. of the International Static Analysis Symposium","author":"C. Speirs","year":"1997","unstructured":"C. Speirs, Z. Somogyi, and H. S\u00f8ndergaard. Termination analysis for Mercury. In P. Van Hentenryck, editor, Proc. of the International Static Analysis Symposium, volume 1302 of LNCS, pages 160\u2013171. Springer-Verlag, 1997."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45789-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:21:06Z","timestamp":1708165266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45789-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442356","9783540457893"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45789-5_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}