{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:47:07Z","timestamp":1743086827740,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205507"},{"type":"electronic","value":"9783642205514"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20551-4_12","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T08:04:40Z","timestamp":1303286680000},"page":"184-199","source":"Crossref","is-referenced-by-count":3,"title":["Dependency Triples for Improving Termination Analysis of Logic Programs with Cut"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Str\u00f6der","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_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, London (1997)"},{"issue":"1,2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting using Dependency Pairs. Theoretical Computer Science\u00a0236(1,2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination Analysis of Logic Programs through Combination of Type-Based Norms. ACM Transactions on Programming Languages and Systems\u00a029(2), article 10 (2007)","DOI":"10.1145\/1216374.1216378"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11562931_25","volume-title":"Logic Programming","author":"M. Codish","year":"2005","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Testing for Termination with Monotonicity Constraints. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 326\u2013340. Springer, Heidelberg (2005)"},{"issue":"20","key":"12_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","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":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61411-8","volume-title":"Prolog: The Standard","author":"P. Deransart","year":"1996","unstructured":"Deransart, P., Ed-Dbali, A., Cervoni, L.: Prolog: The Standard. Springer, New York (1996)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1005797629953","volume":"19","author":"J. Giesl","year":"1997","unstructured":"Giesl, J.: Termination of Nested and Mutually Recursive Algorithms. Journal of Automated Reasoning\u00a019, 1\u201329 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"issue":"1,2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ic.2004.10.004","volume":"199","author":"N. Hirokawa","year":"2005","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the Dependency Pair Method. Information and Computation\u00a0199(1,2), 172\u2013199 (2005)","journal-title":"Information and Computation"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068402001485","volume":"3","author":"J.M. Howe","year":"2003","unstructured":"Howe, J.M., King, A.: Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming\u00a03(1), 95\u2013124 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BFb0014328","volume-title":"Algebraic Methodology and Software Technology","author":"M. Marchiori","year":"1996","unstructured":"Marchiori, M.: Proving Existential Termination of Normal Logic Programs. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101, pp. 375\u2013390. Springer, Heidelberg (1996)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1017\/S1471068407003122","volume":"8","author":"F. Mesnard","year":"2007","unstructured":"Mesnard, F., Serebrenik, A.: Recurrence with Affine Level Mappings is P-Time Decidable for CLP(R). Theory and Practice of Logic Programming\u00a08(1), 111\u2013119 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-78769-3_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M.T. Nguyen","year":"2008","unstructured":"Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination Analysis of Logic Programs Based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol.\u00a04915, pp. 8\u201322. Springer, Heidelberg (2008)"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S1471068410000025","volume":"11","author":"M.T. Nguyen","year":"2010","unstructured":"Nguyen, M.T., De Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. Theory and Practice of Logic Programming\u00a011(1), 33\u201363 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated Termination Proofs for Logic Programs by Term Rewriting. ACM Transactions on Computational Logic\u00a011(1), Article 2 (2009)","DOI":"10.1145\/1614431.1614433"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12592-8_4","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P. Schneider-Kamp","year":"2010","unstructured":"Schneider-Kamp, P., Giesl, J., Nguyen, M.T.: The Dependency Triple Framework for Termination of Logic Programs. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 37\u201351. Springer, Heidelberg (2010)"},{"issue":"4-6","key":"12_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S1471068410000165","volume":"10","author":"P. Schneider-Kamp","year":"2010","unstructured":"Schneider-Kamp, P., Giesl, J., Str\u00f6der, T., Serebrenik, A., Thiemann, R.: Automated Termination Analysis for Logic Programs with Cut. Theory and Practice of Logic Programming\u00a010(4-6), 365\u2013381 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S1471068404002248","volume":"5","author":"A. Serebrenik","year":"2005","unstructured":"Serebrenik, A., De Schreye, D.: On Termination of Meta-Programs. Theory and Practice of Logic Programming\u00a05(3), 355\u2013390 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR20","unstructured":"Str\u00f6der, T.: Towards Termination Analysis of Real Prolog Programs. Diploma Thesis, RWTH Aachen (2010), \n                  \n                    http:\/\/aprove.informatik.rwth-aachen.de\/eval\/cutTriples\/"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Str\u00f6der, T., Schneider-Kamp, P., Giesl, J.: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. Technical Report AIB 2010-12, RWTH Aachen (2010), \n                  \n                    http:\/\/aib.informatik.rwth-aachen.de\/","DOI":"10.1007\/978-3-642-20551-4_12"},{"key":"12_CR22","unstructured":"The Termination Competition, \n                  \n                    http:\/\/www.termination-portal.org\/wiki\/Termination_Competition\n                  \n                  \n                ."},{"key":"12_CR23","unstructured":"The Termination Problem Data Base 7.0 (December 11, 2009), \n                  \n                    http:\/\/termcomp.uibk.ac.at\/status\/downloads\/"},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0004-3702(94)90063-9","volume":"71","author":"C. Walther","year":"1994","unstructured":"Walther, C.: On Proving the Termination of Algorithms by Machine. Artificial Intelligence\u00a071(1), 101\u2013157 (1994)","journal-title":"Artificial Intelligence"}],"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-20551-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:25:27Z","timestamp":1558571127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20551-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205507","9783642205514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20551-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}