{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:50:18Z","timestamp":1783684218060,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163098","type":"print"},{"value":"9783642163104","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16310-4_4","type":"book-chapter","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T03:44:29Z","timestamp":1285904669000},"page":"35-51","source":"Crossref","is-referenced-by-count":6,"title":["A Dependency Pair Framework for A\u2009\u2228\u2009C-Termination"],"prefix":"10.1007","author":[{"given":"Beatriz","family":"Alarc\u00f3n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1-2","key":"4_CR1","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":"4_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2007.05.041","volume":"188","author":"B. Alarc\u00f3n","year":"2007","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Iborra, J., Lucas, S.: Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electronic Notes in Theoretical Computer Science\u00a0188, 105\u2013115 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"4_CR3","series-title":"LNAI","first-page":"246","volume-title":"FroCoS 2009","author":"F. Dur\u00e1n","year":"2009","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: Termination Modulo Combinations of Equational Theories. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS (LNAI), vol.\u00a05749, pp. 246\u2013262. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10990-008-9028-2","volume":"21","author":"F. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., March\u00e9, C., Meseguer, J., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation\u00a021(1-2), 59\u201388 (2008)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45127-7_9","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Kapur, D.: Dependency Pairs for Equational Rewriting. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 93\u2013108. Springer, Heidelberg (2001)"},{"issue":"3","key":"4_CR6","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 Automatic Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automatic Reasoning"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency Pairs Revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 249\u2013268. Springer, Heidelberg (2004)"},{"key":"4_CR8","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, 172\u2013199 (2005)","journal-title":"Information and Computation"},{"key":"4_CR9","unstructured":"Kusakari, K.: Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems. PhD. Thesis, School of Information Science, JAIST (2000)"},{"key":"4_CR10","first-page":"205","volume":"37","author":"K. Kusakari","year":"2006","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Elimination Transformations for Associative-Commutative Rewriting Systems. Journal of Automated Reasoning\u00a037, 205\u2013229 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR11","unstructured":"Kusakari, K., Toyama, Y.: On Proving AC-Termination by AC-Dependency Pairs. IEICE Transactions on Information and Systems, E84-D, 604\u2013612 (2001)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.entcs.2009.05.021","volume":"238","author":"S. Lucas","year":"2009","unstructured":"Lucas, S., Meseguer, J.: Operational Termination of Membership Equational Programs: the Order-Sorted Way. Electronic Notes in Theoretical Computer Science\u00a0238(3), 207\u2013225 (2009)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BFb0052374","volume-title":"Rewriting Techniques and Applications","author":"C. March\u00e9","year":"1998","unstructured":"March\u00e9, C., Urbain, X.: Termination of associative-commutative rewriting by dependency pairs. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 241\u2013255. Springer, Heidelberg (1998)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jsc.2004.02.003","volume":"38","author":"C. March\u00e9","year":"2004","unstructured":"March\u00e9, C., Urbain, X.: Modular and incremental proofs of AC-termination. Journal of Symbolic Computation\u00a038, 873\u2013897 (2004)","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete Sets of Reductions for Some Equational Theories. Journal of the ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16310-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T11:34:54Z","timestamp":1553168094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16310-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163098","9783642163104"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16310-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}