{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:40Z","timestamp":1750308160581,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2004,7]]},"abstract":"<jats:p>In logic programming,<jats:italic>dynamic scheduling<\/jats:italic>indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the left-to-right one of Prolog.<jats:italic>Input-consuming derivations<\/jats:italic>were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input-consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of model-theoretic semantics previously proposed for left-to-right derivations.<\/jats:p>","DOI":"10.1145\/1013560.1013564","type":"journal-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:38:56Z","timestamp":1097170736000},"page":"470-507","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Termination of simply moded logic programs with dynamic scheduling"],"prefix":"10.1145","volume":"5","author":[{"given":"Annalisa","family":"Bossi","sequence":"first","affiliation":[{"name":"Universit\u00e0 Ca' Foscari di Venezia, Venice, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Etalle","sequence":"additional","affiliation":[{"name":"Universiteit Twente and CWI Amsterdam, Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 Ca' Foscari di Venezia, Venice, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Georg","family":"Smaus","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Freiburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,7]]},"reference":[{"volume-title":"Handbook of Theoretical Computer Science","author":"Apt K. R.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","unstructured":"Apt K. R. 1997. From Logic Programming to Prolog. Prentice Hall London U.K.]] Apt K. R. 1997. From Logic Programming to Prolog. Prentice Hall London U.K.]]"},{"volume":"711","volume-title":"Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS'93)","author":"Apt K. R.","key":"e_1_2_1_3_1"},{"volume":"936","volume-title":"Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology (AMAST'95)","author":"Apt K. R.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Apt K. R. and Pedreschi D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory G. Levi Ed. Oxford University Press Oxford U.K. 183--229.]] Apt K. R. and Pedreschi D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory G. Levi Ed. Oxford University Press Oxford U.K. 183--229.]]","DOI":"10.1093\/oso\/9780198538530.003.0004"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-0551(01)00005-4"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001326"},{"volume":"2028","volume-title":"Proceedings of the European Symposium on Programming","author":"Bossi A.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Bossi A. Gabrielli M. Levi G. and Martelli M. 1994. The S-semantics approach: Theory and applications. J. Logic Programm. 19 & 20 149--198.]] Bossi A. Gabrielli M. Levi G. and Martelli M. 1994. The S-semantics approach: Theory and applications. J. Logic Programm. 19 & 20 149--198.]]","DOI":"10.1016\/0743-1066(94)90026-4"},{"key":"e_1_2_1_10_1","unstructured":"Boye J. 1996. Directional types in logic programming. Ph.D. dissertation Link\u00f6pings Universitet Link\u00f6ping Sweden]] Boye J. 1996. Directional types in logic programming. Ph.D. dissertation Link\u00f6pings Universitet Link\u00f6ping Sweden]]"},{"volume":"493","volume-title":"Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT\/CAAP), S. Abramsky and T. Maibaum, Eds. Lecture Notes in Computer Science","author":"de Boer F.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0743-1066(98)10025-0","article-title":"Termination of well-moded programs","volume":"38","author":"Etalle S.","year":"1999","journal-title":"J. Logic Programm."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/503502.503504"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2638"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/359131.359136"},{"key":"e_1_2_1_16_1","unstructured":"Lloyd J. W. 1987. Foundations of Logic Programming 2nd ed. Symbolic Computation---Artificial Intelligence Series. Springer-Verlag Berlin Berlin Germany.]] Lloyd J. W. 1987. Foundations of Logic Programming 2nd ed. Symbolic Computation---Artificial Intelligence Series. Springer-Verlag Berlin Berlin Germany.]]"},{"volume-title":"Proceedings of the 10th International Conference on Logic Programming","year":"1993","author":"L\u00fcttringhaus-Kappel S.","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10034-1","article-title":"Termination of logic programs with delay declarations","volume":"39","author":"Marchiori E.","year":"1999","journal-title":"J. Logic Programm."},{"volume":"1214","volume-title":"Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development","author":"Martin J. C.","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","unstructured":"Naish L. 1982 (Revised July 1983). An introduction to MU-Prolog. Tech. rep. 82\/2 Department of Computer Science University of Melbourne Melbourne Australia.]] Naish L. 1982 (Revised July 1983). An introduction to MU-Prolog. Tech. rep. 82\/2 Department of Computer Science University of Melbourne Melbourne Australia.]]"},{"key":"e_1_2_1_21_1","volume-title":"Lecture Notes in Computer Science","volume":"238","author":"Naish L.","year":"1986"},{"volume-title":"Parallelizing NU-Prolog. In Proceedings of the 5th International Conference\/Symposium on Logic Programming","year":"1988","author":"Naish L.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","first-page":"181","article-title":"Coroutining and the construction of terminating logic programs","volume":"15","author":"Naish L.","year":"1993","journal-title":"Australian Comput. Sci. Commun."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001400"},{"volume-title":"Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy","series-title":"Lecture Notes in Computer Science","author":"Ruggieri S.","key":"e_1_2_1_25_1"},{"volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages","author":"Saraswat V. A.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","unstructured":"Smaus J.-G. 1999a. Modes and types in logic programming. Ph.D. dissertation University of Kent at Canterbury Canterbury U.K. Available online from http:\/\/www.cs.ukc.ac.uk\/pubs\/1999\/986\/.]] Smaus J.-G. 1999a. Modes and types in logic programming. Ph.D. dissertation University of Kent at Canterbury Canterbury U.K. Available online from http:\/\/www.cs.ukc.ac.uk\/pubs\/1999\/986\/.]]"},{"volume-title":"Proceedings of the 16th International Conference on Logic Programming","year":"1999","author":"Smaus J.-G.","key":"e_1_2_1_28_1"},{"volume":"1490","volume-title":"Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming","author":"Smaus J.-G.","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001107"},{"key":"e_1_2_1_31_1","unstructured":"Sterling L. and Shapiro E. 1986. The Art of Prolog. The MIT Press Cambridge MA.]] Sterling L. and Shapiro E. 1986. The Art of Prolog. The MIT Press Cambridge MA.]]"},{"volume-title":"Proceedings of the International Conference on Fifth Generation Computer Systems. Institute for New Generation Computer Technology","author":"Ueda K.","key":"e_1_2_1_32_1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03038307"},{"volume-title":"Logic Programming, K. Clark and S.-A","author":"van Emden M. H.","key":"e_1_2_1_34_1"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1013560.1013564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1013560.1013564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:19:03Z","timestamp":1750263543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1013560.1013564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["10.1145\/1013560.1013564"],"URL":"https:\/\/doi.org\/10.1145\/1013560.1013564","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2004,7]]},"assertion":[{"value":"2004-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}