{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:22:02Z","timestamp":1725484922860},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_13","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T01:24:41Z","timestamp":1180661081000},"page":"194-208","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Semantics of Input-Consuming Logic Programs"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"Bossi","sequence":"first","affiliation":[]},{"given":"Sandro","family":"Etalle","sequence":"additional","affiliation":[]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"13_CR1","series-title":"Formal Models and Semantics","first-page":"495","volume-title":"Handbook of Theoretical Computer Science","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495\u2013574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990."},{"key":"13_CR2","unstructured":"K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST\u201995)","author":"K. R. Apt","year":"1995","unstructured":"K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST\u201995), Lecture Notes in Computer Science, Berlin, 1995. Springer-Verlag."},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1145\/177492.177673","volume":"16","author":"R. Apt","year":"1994","unstructured":"R. Apt and A. Pellegrini. On the occur-check free Prolog programs. ACM Toplas, 16(3):687\u2013726, 1994.","journal-title":"ACM Toplas"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Electronic Notes in Theoretical Computer Science, 30(1), 1999. \n                    http:\/\/www.elsevier.nl\/locate\/entcs\n                    \n                  , temporarily available at http:\/\/www.cs.unimaas.nl\/~etalle\/papers\/index.htm.","DOI":"10.1016\/S1571-0661(04)00116-1"},{"key":"13_CR6","unstructured":"A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Technical Report CS 99-06, Universiteit Maastricht, 1999."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"A. Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. Technical Report CS 00-01, Universiteit Maastricht, 2000.","DOI":"10.1007\/3-540-44957-4_13"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Annalisa Bossi, Maurizio Gabrielli, Giorgio Levi, and Maurizio Martelli. The S-semantics approach: Theory and applications. The Journal of Logic Programming, 19 & 20:149\u2013198, May 1994.","DOI":"10.1016\/0743-1066(94)90026-4"},{"key":"13_CR9","volume-title":"Technical report","author":"R. Chadha","year":"1991","unstructured":"R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991."},{"key":"13_CR10","unstructured":"P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29\u201338, Boston, 1985."},{"issue":"3","key":"13_CR11","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 behavior of logic languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"13_CR12","volume-title":"Symbolic Computation-Artificial Intelligence","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming Symbolic Computation-Artificial Intelligence. Springer-Verlag, Berlin, 1987. Second edition.","edition":"Second edition"},{"key":"13_CR13","unstructured":"L. Naish. An introduction to mu-prolog. Technical Report 82\/2, The University of Melbourne, 1982."},{"key":"13_CR14","unstructured":"J. G. Smaus. Proving termination of input-consuming logic programs. In D. De Schreye, editor, 16th International Conference on Logic Programming. MIT press, 1999."},{"key":"13_CR15","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":"13_CR16","unstructured":"M.H. van Emden and G.J. de Lucena. Predicate logic as a language for parallel programming. In K.L. Clark and S.-A. T\u00e4rnlund, editors, Logic Programming, London, 1982. Academic Press."}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:29:53Z","timestamp":1558258193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}