{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:55:28Z","timestamp":1743008128686,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_4","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"90-114","source":"Crossref","is-referenced-by-count":0,"title":["Declarative Semantics of Input Consuming Logic Programs"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"Bossi","sequence":"first","affiliation":[]},{"given":"Nicoletta","family":"Cocco","sequence":"additional","affiliation":[]},{"given":"Sandro","family":"Etalle","sequence":"additional","affiliation":[]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Logic Programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 495\u2013574. Elsevier\/The MIT Press, Amsterdam\/Cambridge\/MA (1990)","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"4_CR2","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice Hall, London (1997)"},{"issue":"3&4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Bezem, M.: Acyclic programs. New Generation Computing\u00a09(3&4), 335\u2013363 (1991)","journal-title":"New Generation Computing"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Mathematical Foundations of Computer Science 1993","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Etalle, S.: On the unification free Prolog programs. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 1\u201319. Springer, Heidelberg (1993)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Algebraic Methodology and Software Technology","author":"K.R. Apt","year":"1995","unstructured":"Apt, K.R., Luitjes, I.: Verification of logic programs with delay declarations. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, pp. 1\u201319. Springer, Heidelberg (1995)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-54415-1_50","volume-title":"Theoretical Aspects of Computer Software","author":"K.R. Apt","year":"1991","unstructured":"Apt, K.R., Pedreschi, D.: Proving termination of general Prolog programs. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol.\u00a0526, pp. 265\u2013289. Springer, Heidelberg (1991)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K.R. Apt","year":"1993","unstructured":"Apt, K.R., Pedreschi, D.: Reasoning about termination of pure Prolog programs. Information and Computation\u00a0106(1), 109\u2013157 (1993)","journal-title":"Information and Computation"},{"issue":"1&2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","volume":"15","author":"M. Bezem","year":"1993","unstructured":"Bezem, M.: Strong termination of logic programs. Journal of Logic Programming\u00a015(1&2), 79\u201397 (1993)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0096-0551(01)00005-4","volume":"26","author":"S. Bossi","year":"2000","unstructured":"Bossi, S.: Etalle, and S. Rossi. Semantics of well-moded input-consuming logic programs. Computer Languages\u00a026(1), 1\u201325 (2000)","journal-title":"Computer Languages"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1017\/S1471068401001326","volume":"2","author":"A. Bossi","year":"2002","unstructured":"Bossi, A., Etalle, S., Rossi, S.: Properties of input-consuming derivations. Theory and Practice of Logic Programming\u00a02(2), 125\u2013154 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45309-1_27","volume-title":"Programming Languages and Systems","author":"A. Bossi","year":"2001","unstructured":"Bossi, A., Etalle, S., Rossi, S., Smaus, J.-G.: Semantics and termination of simplymoded logic programs with dynamic scheduling. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 402\u2013416. Springer, Heidelberg (2001)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bossi, S., Etalle, S.: Rossi, and J.-G. Smaus. Termination of simply-moded logic programs with dynamic scheduling. ACM Transactions on Computational Logic (TOCL) (2004) (to appear)","DOI":"10.1145\/1013560.1013564"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19&20","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Gabrielli, M., Levi, G., Martelli, M.: The S-semantics approach: Theory and applications. The Journal of Logic Programming\u00a019&20, 149\u2013198 (1994)","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1017\/S1471068402001382","volume":"2","author":"A. Bossi","year":"2002","unstructured":"Bossi, A., Etalle, S., Cocco, N., Rossi, S.: On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming\u00a02(3), 263\u2013291 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR15","unstructured":"Chadha, R., Plaisted, D.A.: Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C (1991)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-53982-4_17","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"F.S. de Boer","year":"1991","unstructured":"de Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 296\u2013319. Springer, Heidelberg (1991)"},{"key":"4_CR17","first-page":"417","volume-title":"Proc. Twelfth International Logic Programming Symposium","author":"M. Garcia de la Banda","year":"1995","unstructured":"Garcia de la Banda, M., Marriott, K., Stuckey, P.: Efficient analysis of logic programs with dynamic scheduling. In: Lloyd, J. (ed.) Proc. Twelfth International Logic Programming Symposium, pp. 417\u2013431. The MIT Press, Cambridge (1995)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19-20","author":"D. De Schreye","year":"1994","unstructured":"De Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. Journal of Logic Programming\u00a019-20, 199\u2013260 (1994)","journal-title":"Journal of Logic Programming"},{"key":"4_CR19","first-page":"487","volume-title":"Proc. Eleventh International Logic Programming Symposium","author":"S. Debray","year":"1994","unstructured":"Debray, S., Gudemann, D., Bigot, P.: Detection and optimization of suspensionfree logic programs. In: Bruynooghe, M. (ed.) Proc. Eleventh International Logic Programming Symposium, pp. 487\u2013504. The MIT Press, Cambridge (1994)"},{"key":"4_CR20","unstructured":"Dembinski, P., Maluszynski, J.: AND-parallelism with intelligent backtracking for annotated logic programs. In: Proceedings of the International Symposium on Logic Programming, Boston, pp. 29\u201338 (1985)"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0743-1066(98)10025-0","volume":"38","author":"S. Etalle","year":"1999","unstructured":"Etalle, S., Bossi, A., Cocco, N.: Termination of well-moded programs. Journal of Logic Programming\u00a038(2), 243\u2013257 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1145\/503502.503504","volume":"23","author":"S. Etalle","year":"2002","unstructured":"Etalle, S., Gabbrielli, M., Meo, M.C.: Transformations of CCP programs. ACM Transactions on Programming Languages and Systems\u00a023(3), 304\u2013395 (2002)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/inco.1997.2638","volume":"137","author":"M. Falaschi","year":"1997","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Constraint logic programming with dynamic scheduling: a semantics based on closure operators. Information and Computation\u00a0137(1), 41\u201367 (1997)","journal-title":"Information and Computation"},{"key":"4_CR24","volume-title":"Proceedings of the IEEE Symposium on Logic in Computer Science","author":"M. Falaschi","year":"1993","unstructured":"Falaschi, M., Gabrielli, M., Marriott, K., Palamidessi, C.: Compositional analysis for concurrent constraint programming. In: Proceedings of the IEEE Symposium on Logic in Computer Science, IEEE, Los Alamitos (1993)"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science\u00a069(3), 289\u2013318 (1989)","journal-title":"Theoretical Computer Science"},{"key":"4_CR26","volume-title":"The G\u00f6del programming language","author":"P.M. Hill","year":"1994","unstructured":"Hill, P.M., Lloyd, J.W.: The G\u00f6del programming language. MIT Press, Cambridge (1994)"},{"key":"4_CR27","unstructured":"IC Parck, Imperial College London. The ECLiPSe Constraint Logic Programming System (2003), http:\/\/www-icparc.doc.ic.ac.uk\/eclipse\/"},{"key":"4_CR28","unstructured":"Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog Page (2003), http:\/\/www.sics.se\/sicstus\/"},{"key":"4_CR29","volume-title":"Foundations of Logic Programming. Symbolic Computation \u2013 Artificial Intelligence","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Symbolic Computation \u2013 Artificial Intelligence, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"issue":"1-3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10034-1","volume":"39","author":"E. Marchiori","year":"1999","unstructured":"Marchiori, E., Teusink, F.: Termination of logic programs with delay declarations. Journal of Logic Programming\u00a039(1-3), 95\u2013124 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0743-1066(96)00127-6","volume":"32","author":"K. Marriott","year":"1997","unstructured":"Marriott, K.: Algebraic and logical semantics for CLP languages with dynamic scheduling. Journal of Logic Programming\u00a032(1), 71\u201384 (1997)","journal-title":"Journal of Logic Programming"},{"key":"4_CR32","first-page":"240","volume-title":"Proc. 21st Annual ACM Symp. on Principles of Programming Languages","author":"K. Marriott","year":"1994","unstructured":"Marriott, K., Garcia de la Banda, M., Hermenegildo, M.: Analyzing logic programs with dynamic scheduling. In: Proc. 21st Annual ACM Symp. on Principles of Programming Languages, pp. 240\u2013253. ACM Press, New York (1994)"},{"key":"4_CR33","unstructured":"Marriott, K., Falaschi, M., Gabrielli, M., Palamidessi, C.: A simple semantics for logic programming languages with delay. In: Proceedings of the Eighteenth Australian Computer Science Conference (1995)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Negation and Control in Prolog","author":"L. Naish","year":"1986","unstructured":"Naish, L.: Negation and control in Prolog. In: Naish, L. (ed.) Negation and Control in Prolog. LNCS, vol.\u00a0238, Springer, Heidelberg (1986)"},{"issue":"1","key":"4_CR35","first-page":"181","volume":"15","author":"L. Naish","year":"1993","unstructured":"Naish, L.: Coroutining and the construction of terminating logic programs. Australian Computer Science Communications\u00a015(1), 181\u2013190 (1993)","journal-title":"Australian Computer Science Communications"},{"key":"4_CR36","first-page":"1546","volume-title":"Proceedings of the Fifth International Conference\/Symposium on Logic Programming","author":"L. Naish","year":"1988","unstructured":"Naish, L.: Parallelizing NU-Prolog. In: Bowen, K.A., Kowalski, R.A. (eds.) Proceedings of the Fifth International Conference\/Symposium on Logic Programming, Seattle, Washington, August 1988, pp. 1546\u20131564. The MIT Press, Cambridge (1988)"},{"key":"4_CR37","unstructured":"Naish, L.: An introduction to MU-Prolog. Technical Report 82\/2, Department of Computer Science, University of Melbourne, Melbourne, Australia (March 1982) (Revised July 1983)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Puebla, G., Garcia de la Banda, M., Marriott, K., Stuckey, P.: Optimization of logic programs with dynamic scheduling. In: ICLP 1997, pp. 93\u2013107 (1997)","DOI":"10.7551\/mitpress\/4299.003.0013"},{"key":"4_CR39","first-page":"232","volume-title":"Proc. of the Seventeenth ACM Symposium on Principles of Programming Languages","author":"V.A. Saraswat","year":"1990","unstructured":"Saraswat, V.A., Rinard, M.: Concurrent constraint programming. In: Proc. of the Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, California, pp. 232\u2013245. ACM, New York (1990)"},{"key":"4_CR40","unstructured":"Smaus, J.-G.: Modes and Types in Logic Programming. PhD thesis, University of Kent at Canterbury (1999), Available from http:\/\/www.cs.ukc.ac.uk\/pubs\/1999\/986\/"},{"key":"4_CR41","first-page":"335","volume-title":"Proceedings of the 16th International Conference on Logic Programming","author":"J.-G. Smaus","year":"1999","unstructured":"Smaus, J.-G.: Proving termination of input-consuming logic programs. In: De Schreye, D. (ed.) Proceedings of the 16th International Conference on Logic Programming, Las Cruces, New Mexico, USA, pp. 335\u2013349. The MIT Press, Cambridge (1999)"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0056608","volume-title":"Principles of Declarative Programming","author":"J.-G. Smaus","year":"1998","unstructured":"Smaus, J.-G., Hill, P.M., King, A.M.: Termination of logic programs with block declarations running in several modes. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol.\u00a01490, pp. 73\u201388. Springer, Heidelberg (1998)"},{"key":"4_CR43","first-page":"441","volume-title":"Programming of Future Generation Computers","author":"K. Ueda","year":"1988","unstructured":"Ueda, K.: Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In: Nivat, M., Fuchi, K. (eds.) Programming of Future Generation Computers, pp. 441\u2013456. North Holland, Amsterdam (1988)"},{"key":"4_CR44","unstructured":"Ueda, K., Furukawa, K.: Transformation rules for GHC Programs. In: Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, pp. 582\u2013591. Institute for New Generation Computer Technology, Tokyo, OHMSHA Ltd. Tokyo and Springer-Verlag (1988)"},{"issue":"1","key":"4_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03038307","volume":"13","author":"K. Ueda","year":"1994","unstructured":"Ueda, K., Morita, M.: Moded flat GHC and its message-oriented implementation technique. New Generation Computing\u00a013(1), 3\u201343 (1994)","journal-title":"New Generation Computing"},{"key":"4_CR46","volume-title":"Logic Programming","author":"M.H. van Emden","year":"1982","unstructured":"van Emden, M.H., de Lucena, G.J.: Predicate logic as a language for parallel programming. In: Clark, K.L., T\u00e4rnlund, S.-A. (eds.) Logic Programming, Academic Press, London (1982)"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T01:17:05Z","timestamp":1711675025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}