{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:08:29Z","timestamp":1725890909984},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650744"},{"type":"electronic","value":"9783540496748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49674-2_11","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T01:41:54Z","timestamp":1187055714000},"page":"206-225","source":"Crossref","is-referenced-by-count":5,"title":["Unfolding the Mystery of Mergesort"],"prefix":"10.1007","author":[{"given":"N.","family":"Lindenstrauss","sequence":"first","affiliation":[]},{"given":"Y.","family":"Sagiv","sequence":"additional","affiliation":[]},{"given":"A.","family":"Serebrenik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"11_CR1","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"11_CR2","unstructured":"K. R. Apt and D. Pedreschi. Modular Termination Proofs for Logic and Pure Prolog Programs. In Advances in Logic Programming Theory, 183\u2013229. Oxford University Press, 1994."},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","volume-title":"LOPSTR\u201996","author":"F. Benoy","year":"1996","unstructured":"F. Benoy and A. King. Inferring Argument Size Relationships with CLP(R). LOPSTR\u201996. Springer Lecture Notes in Computer Science."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-58431-5_19","volume-title":"ALP\u201994","author":"A. Bossi","year":"1994","unstructured":"A. Bossi and N. Cocco. Preserving Universal Termination Through Unfold\/Fold. ALP\u201994, 269\u2013286. Springer Lecture Notes in Computer Science 850, 1994."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. Brodsky and Y. Sagiv. Inference of Monotonicity Constraints in Datalog Programs. Proceedings of the Eighth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, 1989, 190\u2013199.","DOI":"10.1145\/73721.73741"},{"key":"11_CR6","unstructured":"M. Codish and C. Taboch. A Semantic Basis for Termination Analysis of Logic Programs. ALP\u201997."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. J. Logic Programming, 13:103\u2013179, 1992.","journal-title":"J. Logic Programming"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\u201320","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of Logic Programs: the Never-Ending Story. J. Logic Programming, 19\u201320:199\u2013260, 1994.","journal-title":"J. Logic Programming"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli and C. Palamidessi. Declarative Modeling of the Operational Behaviour of Logic Programs. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"A. Levy and Y. Sagiv. Constraints and Redundancy in Datalog. PODS\u201992, 67\u201380. ACM, 1992.","DOI":"10.1145\/137097.137111"},{"key":"11_CR11","unstructured":"N. Lindenstrauss and Y. Sagiv. Checking Termination of Queries to Logic Programs. Available at http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"11_CR12","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic Termination Analysis of Logic Programs. ICLP\u201997. MIT Press, 1997."},{"key":"11_CR13","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic Termination Analysis of Logic Programs (with Detailed Experimental Results). Available at http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"N. Lindenstrauss, Y. Sagiv, A. Serebrenik. TermiLog: A System for Checking Termination of Queries to Logic Programs. CAV\u201997. Springer Lecture Notes in Computer Science, 1997.","DOI":"10.1007\/3-540-63166-6_44"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. Springer Verlag, LNAI 446, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"11_CR16","unstructured":"Y. Sagiv. A termination test for logic programs. In International Logic Programming Symposium. MIT Press, 1991."},{"key":"11_CR17","unstructured":"SICStus Prolog User\u2019s Manual, Release 3 # 3. Swedish Institute of Computer Science, 1995."},{"key":"11_CR18","unstructured":"J. D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. II. Computer Science Press, 1989."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman and A. Van Gelder. Efficient Tests for Top-Down Termination of Logical Rules. Journal of the ACM, 35, 1988, 345\u2013373.","journal-title":"Journal of the ACM"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01530930","volume":"3","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder. Deriving Constraints among Argument Sizes in Logic Programs. Annals of Mathematics and Artificial Intelligence, 3:361\u2013392, 1991.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"K. Verschaetse, S. Decorte and D. De Schreye. Automatic Termination Analysis. LOPSTR 92, ed. K. K. Lau and T. Clement. Workshops in Computing Series, Springer, 1992.","DOI":"10.1007\/978-1-4471-3560-9_12"}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49674-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T21:04:19Z","timestamp":1556744659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}