{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:08Z","timestamp":1747546928394},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631668"},{"type":"electronic","value":"9783540691952"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63166-6_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:14:03Z","timestamp":1330298043000},"page":"444-447","source":"Crossref","is-referenced-by-count":18,"title":["TermiLog: A system for checking termination of queries to logic programs"],"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":[[2005,6,7]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K. R. Apt","year":"1991","unstructured":"K. R. Apt and M. Bezem. Acyclic Programs. New Generation Computing, 9:335\u2013363, 1991.","journal-title":"New Generation Computing"},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and D. Pedreschi. Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106:109\u2013157, 1993.","journal-title":"Information and Computation"},{"key":"44_CR3","doi-asserted-by":"crossref","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.","DOI":"10.1093\/oso\/9780198538530.003.0004"},{"key":"44_CR4","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":"44_CR5","unstructured":"F. Bueno, M. Garc\u00eda de la Banda and M. Hermenegildo. Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. International Symposium on Logic Programming, 320\u2013336. MIT Press, 1994."},{"key":"44_CR6","doi-asserted-by":"crossref","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":"44_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\/20","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\/20:199\u2013260, 1994.","journal-title":"J. Logic Programming"},{"key":"44_CR8","unstructured":"N. Lindenstrauss and Y. Sagiv. Checking Termination of Queries to Logic Programs. http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic Termination Analysis of Logic Programs. ICLP'97. MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0011"},{"key":"44_CR10","unstructured":"N. Lindenstrauss and Y. Sagiv. Automatic Termination Analysis of Logic Programs (with Detailed Experimental Results). http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"44_CR11","unstructured":"N. Lindenstrauss, Y. Sagiv and A. Serebrenik. An Example Session with TermiLog. http:\/\/www.cs.huji.ac.il\/~naomil\/"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, second edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"44_CR13","unstructured":"R. A. O'Keefe. The Craft of Prolog. MIT Press, 1990."},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"L. Plumer. Termination Proofs for Logic Programs. Springer Verlag, LNAI 446, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"44_CR15","unstructured":"Y. Sagiv. A termination test for logic programs. In International Logic Programming Symposium. MIT Press, 1991."},{"key":"44_CR16","unstructured":"SICStus Prolog User's Manual. Release 3. Swedish Institute of Computer Science, 1995."},{"key":"44_CR17","unstructured":"L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986."},{"issue":"2","key":"44_CR18","doi-asserted-by":"crossref","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. JACM 35:2(1988), 345\u2013373.","journal-title":"JACM"},{"key":"44_CR19","doi-asserted-by":"crossref","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":"44_CR20","unstructured":"C. Verschaetse. Static Termination Analysis for Definite Horn Clause Programs. Ph.D. Thesis, K.U. Leuven, 1992."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63166-6_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:08:44Z","timestamp":1713636524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63166-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631668","9783540691952"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63166-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}