{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:09Z","timestamp":1762458849438},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_18","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"249-268","source":"Crossref","is-referenced-by-count":45,"title":["Dependency Pairs Revisited"],"prefix":"10.1007","author":[{"given":"Nao","family":"Hirokawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"133","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical. Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Computer Science"},{"key":"18_CR2","unstructured":"Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen (2001)"},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/3-540-16780-3_76","volume-title":"8th International Conference on Automated Deduction","author":"L. Bachmair","year":"1986","unstructured":"Bachmair, L., Dershowitz, N.: Commutation, transformation, and termination. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 5\u201320. Springer, Heidelberg (1986)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/10721959_27","volume-title":"Automated Deduction - CADE-17","author":"C. Borralleras","year":"2000","unstructured":"Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 346\u2013364. Springer, Heidelberg (2000)"},{"key":"18_CR6","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME version 2 (2000), Available at http:\/\/cime.lri.fr\/"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Term Rewriting","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 Examples of termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol.\u00a0909, pp. 16\u201326. Springer, Heidelberg (1995)"},{"key":"18_CR8","unstructured":"Dershowitz, N.: Termination dependencies. In: Proceedings of the 6th International Workshop on Termination, Technical Report DSIC-II\/15\/03, Universidad Polit\u00e9cnica de Valencia, pp. 27\u201330 (2003)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation\u00a034(1), 21\u201358 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-39813-4_11","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Improving dependency pairs. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing dependency pairs. Technical Report AIB-2003-08, RWTH Aachen, Germany (2003)","DOI":"10.1007\/978-3-540-39813-4_11"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"Gramlich, B.: Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a05, 131\u2013158 (1994)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"18_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-45085-6_4","volume-title":"Automated Deduction \u2013 CADE-19","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003) (Full version submitted for publication)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-44881-0_22","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 311\u2013320. Springer, Heidelberg (2003)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool (2004), Available at http:\/\/cl2-informatik.uibk.ac.at\/ttt","DOI":"10.1007\/978-3-540-32033-3_14"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Middeldorp, A.: Approximations for strategies and termination. In: Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming. Electronic Notes in Theoretical Computer Science, vol.\u00a070(6) (2002)","DOI":"10.1016\/S1571-0661(04)80598-X"},{"issue":"12","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/PL00013300","volume":"36","author":"A. Middeldorp","year":"2000","unstructured":"Middeldorp, A., Ohsaki, H.: Type introduction for equational rewriting. Acta Informatica\u00a036(12), 1007\u20131029 (2000)","journal-title":"Acta Informatica"},{"key":"18_CR19","unstructured":"Steinbach, J., K\u00fchler, U.: Check your ordering \u2013 termination proofs and open problems. Technical Report SR-90-25, Universit\u00e4t Kaiserslautern (1990)"},{"key":"18_CR20","unstructured":"Terese, A.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Thiemann, R., Giesl, J., Schneider-Kamp, P.: Improved modular termination proofs using dependency pairs. In: Proceedings of the 2nd International Joint Conference on Automated Reasoning, LNCS(LNAI) 2004 (to appear)","DOI":"10.1007\/978-3-540-25984-8_4"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters\u00a025, 141\u2013143 (1987)","journal-title":"Information Processing Letters"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Urbain, X.: Modular & incremental automated termination proofs. Journal of Automated Reasoning (2004) (to appear)","DOI":"10.1007\/BF03177743"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-25979-4_7","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"2004","unstructured":"Zantema, H.: TORPA: Termination of rewriting proved automatically. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 95\u2013104. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:02:47Z","timestamp":1559664167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}