{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:03:52Z","timestamp":1743912232562,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322105"},{"type":"electronic","value":"9783642322112"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32211-2_16","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:27:23Z","timestamp":1342830443000},"page":"237-252","source":"Crossref","is-referenced-by-count":9,"title":["A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Str\u00f6der","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Emmes","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Fuhs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice Hall (1997)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0743-1066(87)90008-2","volume":"4","author":"B. Arbab","year":"1987","unstructured":"Arbab, B., Berry, D.M.: Operational and denotational semantics of Prolog. Journal of Logic Programming\u00a04, 309\u2013329 (1987)","journal-title":"Journal of Logic Programming"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(95)00006-E","volume":"24","author":"E. B\u00f6rger","year":"1995","unstructured":"B\u00f6rger, E., Rosenzweig, D.: A mathematical definition of full Prolog. Science of Computer Programming\u00a024, 249\u2013286 (1995)","journal-title":"Science of Computer Programming"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cerrito, S.: A linear semantics for allowed logic programs. In: LICS 1990, pp. 219\u2013227. IEEE Press (1990)","DOI":"10.1109\/LICS.1990.113748"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03037941","volume":"10","author":"M.H.M. Cheng","year":"1992","unstructured":"Cheng, M.H.M., Horspool, R.N., Levy, M.R., van Emden, M.H.: Compositional operational semantics for Prolog programs. New Generat. Comp.\u00a010, 315\u2013328 (1992)","journal-title":"New Generat. Comp."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-50939-9_132","volume-title":"TAPSOFT \u201989. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989","author":"A. Bruin de","year":"1989","unstructured":"de Bruin, A., de Vink, E.P.: Continuation Semantics for Prolog with Cut. In: D\u00edaz, J., Yu, Y. (eds.) CAAP 1989 and TAPSOFT 1989. LNCS, vol.\u00a0351, pp. 178\u2013192. Springer, Heidelberg (1989)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0167-6423(90)90072-L","volume":"13","author":"E.P. Vink de","year":"1990","unstructured":"de Vink, E.P.: Comparative semantics for Prolog with cut. Science of Computer Programming\u00a013, 237\u2013264 (1990)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","volume":"5","author":"S.K. Debray","year":"1988","unstructured":"Debray, S.K., Mishra, P.: Denotational and operational semantics for Prolog. Journal of Logic Programming\u00a05(1), 61\u201391 (1988)","journal-title":"Journal of Logic Programming"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S.K. Debray","year":"1993","unstructured":"Debray, S.K., Lin, N.-W.: Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems\u00a015, 826\u2013875 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF03037477","volume":"10","author":"P. Deransart","year":"1992","unstructured":"Deransart, P., Ferrand, G.: An operational formal definition of Prolog: a specification method and its application. New Generation Computing\u00a010, 121\u2013171 (1992)","journal-title":"New Generation Computing"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Deransart, P., Ed-Dbali, A., Cervoni, L.: Prolog: The Standard. Springer (1996)","DOI":"10.1007\/978-3-642-61411-8"},{"key":"16_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N. Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated Complexity Analysis Based on the Dependency Pair Method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 364\u2013379. Springer, Heidelberg (2008)"},{"key":"16_CR13","unstructured":"ISO\/IEC 13211-1. Information technology - Programming languages - Prolog (1995)"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0168-0072(96)00038-3","volume":"84","author":"J. Jeavons","year":"1997","unstructured":"Jeavons, J.: An alternative linear semantics for allowed logic programs. Annals of Pure and Applied Logic\u00a084(1), 3\u201316 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"16_CR15","unstructured":"Jones, N.D., Mycroft, A.: Stepwise development of operational and denotational semantics for Prolog. In: SLP 1984, pp. 281\u2013288. IEEE Press (1984)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kula\u0161, M., Beierle, C.: Defining standard prolog in rewriting logic. In: WRLA\u00a02000. ENTCS, vol.\u00a036 (2001)","DOI":"10.1016\/S1571-0661(05)80121-5"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/69558.69564","volume":"11","author":"T. Nicholson","year":"1989","unstructured":"Nicholson, T., Foo, N.: A denotational semantics for Prolog. ACM Transactions on Programming Languages and Systems\u00a011, 650\u2013665 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR18","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-22438-6_32","volume-title":"Automated Deduction \u2013 CADE-23","author":"L. Noschinski","year":"2011","unstructured":"Noschinski, L., Emmes, F., Giesl, J.: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS(LNAI), vol.\u00a06803, pp. 422\u2013438. Springer, Heidelberg (2011)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Schneider-Kamp, P., Giesl, J., Str\u00f6der, T., Serebrenik, A., Thiemann, R.: Automated termination analysis for logic programs with cut. In: ICLP\u00a02010, Theory and Practice of Logic Programming, vol.\u00a010(4-6), pp. 365\u2013381 (2010)","DOI":"10.1017\/S1471068410000165"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-20551-4_12","volume-title":"Logic-Based Program Synthesis and Transformation","author":"T. Str\u00f6der","year":"2011","unstructured":"Str\u00f6der, T., Schneider-Kamp, P., Giesl, J.: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol.\u00a06564, pp. 184\u2013199. Springer, Heidelberg (2011)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Str\u00f6der, T., Emmes, F., Schneider-Kamp, P., Giesl, J., Fuhs, C.: Fuhs. A linear operational semantics for termination and complexity analysis of ISO Prolog. Technical Report AIB-2011-08, RWTH Aachen (2011), http:\/\/aib.informatik.rwth-aachen.de\/","DOI":"10.1007\/978-3-642-32211-2_16"},{"key":"16_CR22","unstructured":"Zankl, H., Korp, M.: Modular complexity analysis via relative complexity. In: RTA 2010. LIPIcs, vol.\u00a06, pp. 385\u2013400 (2010)"}],"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\/978-3-642-32211-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:08:14Z","timestamp":1743826094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32211-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322105","9783642322112"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32211-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}