{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:38Z","timestamp":1725565418130},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_4","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"43-57","source":"Crossref","is-referenced-by-count":4,"title":["Termination of Logic Programs Using Various Dynamic Selection Rules"],"prefix":"10.1007","author":[{"given":"Jan-Georg","family":"Smaus","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"From Logic Programming to Prolog","author":"K.R. Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1997)"},{"key":"4_CR2","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_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-60043-4_47","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. 66\u201390. Springer, Heidelberg (1995)"},{"issue":"1","key":"4_CR4","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"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/oso\/9780198538530.003.0004","volume-title":"Advances in Logic Programming Theory","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Pedreschi, D.: Modular termination proofs for logic and pure Prolog programs. In: Levi, G. (ed.) Advances in Logic Programming Theory, pp. 183\u2013229. Oxford University Press, Oxford (1994)"},{"issue":"2","key":"4_CR6","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_CR7","doi-asserted-by":"crossref","unstructured":"Bossi, A., Etalle, S., Rossi, S., Smaus, J.-G.: Semantics and termination of simply moded logic programs with dynamic scheduling. Transactions on Computational Logic (2004) (to appear in summer 2004)","DOI":"10.1145\/1013560.1013564"},{"key":"4_CR8","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":"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"},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s002000100065","volume":"1","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing\u00a0(1\/2), 117\u2013156 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"2","key":"4_CR10","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"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-47813-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Genaim","year":"2002","unstructured":"Genaim, S., Codish, M., Gallagher, J., Lagoon, V.: Combining norms to prove termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"key":"4_CR12","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_CR13","first-page":"478","volume-title":"Proceedings of the 10th International Conference on Logic Programming","author":"S. L\u00fcttringhaus-Kappel","year":"1993","unstructured":"L\u00fcttringhaus-Kappel, S.: Control generation for logic programs. In: Warren, D.S. (ed.) Proceedings of the 10th International Conference on Logic Programming, pp. 478\u2013495. MIT Press, Cambridge (1993)"},{"issue":"1-3","key":"4_CR14","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.: On termination of logic programs with delay declarations. Journal of Logic Programming\u00a039(1-3), 95\u2013124 (1999)","journal-title":"Journal of Logic Programming"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0030603","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"J. Martin","year":"1997","unstructured":"Martin, J., King, A.: Generating efficient, terminating logic programs. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 273\u2013284. Springer, Heidelberg (1997)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying static analysis techniques for inferring termination conditions of logic programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"},{"key":"4_CR17","unstructured":"Naish, L.: Coroutining and the construction of terminating logic programs. Technical Report 92\/5, Department of Computer Science, University of Melbourne (1992)"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1471068402001400","volume":"2","author":"D. Pedreschi","year":"2002","unstructured":"Pedreschi, D., Ruggieri, S., Smaus, J.-G.: Classes of terminating logic programs. Theory and Practice of Logic Programming\u00a02(3), 369\u2013418 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR19","first-page":"335","volume-title":"Proc. of the 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.) Proc. of the International Conference on Logic Programming, pp. 335\u2013349. MIT Press, Cambridge (1999)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Smaus, J.-G.: Termination of logic programs for various dynamic selection rules. Technical Report 191, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (2003)","DOI":"10.1007\/978-3-540-24599-5_47"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Smaus, J.-G.: Termination of logic programs using various dynamic selection rules. Technical Report 203, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (2004)","DOI":"10.1007\/978-3-540-27775-0_4"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S1471068401001107","volume":"1","author":"J.-G. Smaus","year":"2001","unstructured":"Smaus, J.-G., Hill, P.M., King, A.M.: Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming\u00a01(4), 447\u2013486 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR23","unstructured":"Swedish Institute of Computer Science. SICStus Prolog User\u2019s Manual (2003), http:\/\/www.sics.se\/isl\/sicstuswww\/site\/documentation.html"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T14:01:27Z","timestamp":1711807287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-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]]}}}