{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:40Z","timestamp":1725487660095},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657651"},{"type":"electronic","value":"9783540489580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48958-4_16","type":"book-chapter","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T02:11:42Z","timestamp":1185156702000},"page":"289-307","source":"Crossref","is-referenced-by-count":0,"title":["Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations"],"prefix":"10.1007","author":[{"given":"Jan-Georg","family":"Smaus","sequence":"first","affiliation":[]},{"given":"Pat","family":"Hill","sequence":"additional","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"16_CR1","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the Conference on Mathematical Foundations of Computer Science","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Conference on Mathematical Foundations of Computer Science, LNCS, pages 1\u201319, Berlin, 1993. Springer-Verlag."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of AMAST\u201995","author":"K. R. Apt","year":"1995","unstructured":"K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In Proceedings of AMAST\u201995, LNCS, Berlin, 1995. Springer-Verlag. Invited Lecture."},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 8th International Workshop on Logic Program Synthesis and Transformation","author":"A. Bossi","year":"1999","unstructured":"A. Bossi and N. Cocco. Successes in logic programs. In P. Flener, editor, Proceedings of the 8th International Workshop on Logic Program Synthesis and Transformation, LNCS. Springer-Verlag, 1999."},{"key":"16_CR5","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":"D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 19\/20:199\u2013260, 1994.","journal-title":"Journal of Logic Programming"},{"key":"16_CR6","unstructured":"S. Etalle, A. Bossi, and N. Cocco. Well-terminating programs. Journal of Logic Programming, 1998. Accepted for publication."},{"key":"16_CR7","unstructured":"P. M. Hill, editor. ALP Newsletter, \n                  http:\/\/www-lp.doc.ic.ac.uk\/alp\/\n                  \n                , February 1998. Pages 17,18."},{"key":"16_CR8","unstructured":"Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User\u2019s Manual, 1997 \n                  http:\/\/www.sics.se\/isl\/sicstus\/sicstus_toc.html"},{"key":"16_CR9","unstructured":"International Organization for Standardization. The ISO Prolog Standard, 1995 \n                  http:\/\/www.logic-programming.org\/prologstd.html"},{"key":"16_CR10","series-title":"Lect Notes Comput Sci","first-page":"213","volume-title":"Proceedings of the 5th Conference for Computer Science Logic","author":"M. R. K. Krishna Rao","year":"1991","unstructured":"M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar. A transformational methodology for proving termination of logic programs. In Proceedings of the 5th Conference for Computer Science Logic, LNCS, pages 213\u2013226. Springer-Verlag, 1991."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"16_CR12","unstructured":"S. L\u00fcttringhaus-Kappel. Control generation for logic programs. In D. S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, pages 478\u2013495. MIT Press, 1993."},{"key":"16_CR13","unstructured":"E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In J. W. Lloyd, editor, Proceedings of the 12th International Logic Programming Symposium, pages 447\u2013461. MIT Press, 1995."},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0743-1066(85)90017-2","volume":"2","author":"L. Naish","year":"1985","unstructured":"L. Naish. Automatic control of logic programs. Journal of Logic Programming, 2(3):167\u2013183, 1985.","journal-title":"Journal of Logic Programming"},{"key":"16_CR15","unstructured":"L. Naish. Coroutining and the construction of terminating logic programs. Technical Report 92\/5, University of Melbourne, 1992."},{"key":"16_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming","author":"J.-G. Smaus","year":"1998","unstructured":"J.-G. Smaus, P. M. Hill, and A. M. King. Termination of logic programs with block declarations running in several modes. In C. Palamidessi, editor, Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming, LNCS. Springer-Verlag, 1998."},{"key":"16_CR17","volume-title":"Technical Report 7-98","author":"J.-G. Smaus","year":"1998","unstructured":"J.-G. Smaus, P. M. Hill, and A. M. King. Verification of logic programs with block declarations running in several modes. Technical Report 7-98, University of Kent at Canterbury, Canterbury, CT2 7NF, United Kingdom, July 1998."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, November 1996.","DOI":"10.1016\/S0743-1066(96)00068-4"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48958-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:33:32Z","timestamp":1550478812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48958-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657651","9783540489580"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48958-4_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}