{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:49Z","timestamp":1761621049321},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_4","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T09:13:30Z","timestamp":1288084410000},"page":"32-46","source":"Crossref","is-referenced-by-count":18,"title":["Automating the Dependency Pair Method"],"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":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/10721975_18","volume-title":"Rewriting Techniques and Applications","author":"T. Arts","year":"2000","unstructured":"Arts, T.: System description: The dependency pair method. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 261\u2013264. Springer, Heidelberg (2000)"},{"key":"4_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. TCS\u00a0236, 133\u2013178 (2000)","journal-title":"TCS"},{"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":"4_CR3"},{"key":"4_CR4","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":"4_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"Bellegarde, F., Lescanne, P.: Termination by completion. AAECC\u00a01, 79\u201396 (1990)","journal-title":"AAECC"},{"key":"4_CR6","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)"},{"unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME version 2 (2000), Available at \n                    \n                      http:\/\/cime.lri.fr\/","key":"4_CR7"},{"key":"4_CR8","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)"},{"issue":"1,2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s002000100063","volume":"12","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. AAECC\u00a012(1,2), 39\u201372 (2001)","journal-title":"AAECC"},{"issue":"1","key":"4_CR10","first-page":"21","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. JSC\u00a034(1), 21\u201358 (2002)","journal-title":"JSC"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2003)"},{"unstructured":"Kamin, S., L\u00e9vy, J.J.: Two generalizations of the recursive path ordering. University of Illinois (1980) (unpublished manuscript)","key":"4_CR12"},{"key":"4_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-45744-5_49","volume-title":"Automated Reasoning","author":"A. Middeldorp","year":"2001","unstructured":"Middeldorp, A.: Approximating dependency graphs using tree automata techniques. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 593\u2013610. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Middeldorp, A.: Approximations for strategies and termination. In: Proc. 2nd WRS. ENTCS, vol.\u00a070(6) (2002)","key":"4_CR14","DOI":"10.1016\/S1571-0661(04)80598-X"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-59200-8_44","volume-title":"Rewriting Techniques and Applications","author":"J. Steinbach","year":"1995","unstructured":"Steinbach, J.: Automatic termination proofs with transformation orderings. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 11\u201325. Springer, Heidelberg (1995)"},{"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":"4_CR16"},{"key":"4_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T17:31:47Z","timestamp":1553189507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}