{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194213},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_3","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T18:27:08Z","timestamp":1167330428000},"page":"47-61","source":"Crossref","is-referenced-by-count":39,"title":["Argument Filtering Transformation"],"prefix":"10.1007","author":[{"given":"Keiichirou","family":"Kusakari","sequence":"first","affiliation":[]},{"given":"Masaki","family":"Nakamura","sequence":"additional","affiliation":[]},{"given":"Yoshihito","family":"Toyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Arts, T.: Automatically Proving Termination and Innermost Normalization of Term Rewriting Systems, PhD thesis, Utrecht University (1997)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BFb0030602","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"T. Arts","year":"1997","unstructured":"Arts, T., Giesl, J.: Automatically Proving Termination where Simplification Orderings Fail. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 261\u2013272. Springer, Heidelberg (1997)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-62950-5_68","volume-title":"Rewriting Techniques and Applications","author":"T. Arts","year":"1997","unstructured":"Arts, T., Giesl, J.: Proving Innermost Normalization Automatically. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 157\u2013171. Springer, Heidelberg (1997)"},{"key":"3_CR4","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. To appear in Theoretical Computer Science"},{"key":"3_CR5","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":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-60249-6_56","volume-title":"Fundamentals of Computation Theory","author":"M. Ferreira","year":"1995","unstructured":"Ferreira, M., Zantema, H.: Dummy Elimination: Making Termination Easier. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 243\u2013252. Springer, Heidelberg (1995)"},{"key":"3_CR7","unstructured":"Ferreira, M.: Termination of Term Rewriting, Well-foundedness, Totality and Trans- formations, PhD thesis, Utrecht University (1995)"},{"key":"3_CR8","unstructured":"Giesl, J., Ohlebusch, E.: Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. In: Proceedings of the Second International Workshop on Frontiers of Combining Systems, FroCos 1998, Amsterdam, The Nether- lands, October 1998. Applied Logic Series (1998)"},{"key":"3_CR9","unstructured":"Klop, J.W.: Term Rewriting Systems. Handbook of Logic in Computer Science II, pp. 1\u2013112. Oxford University Press, Oxford (1992)"},{"key":"3_CR10","unstructured":"Kusakari, K., Toyama, Y.: On Proving AC-Termination by AC-Dependency Pairs, Research Report IS-RR-98-0026F, School of Information Science, JAIST (1998)"},{"key":"3_CR11","unstructured":"Kusakari, K., Toyama, Y.: The Hierarchy of Dependency Pairs, Research Report IS-RR-99-0007F, School of Information Science, JAIST (1999)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument Filtering Transformation, Research Report IS-RR-99-0008F, School of Information Science, JAIST (1999)","DOI":"10.1007\/10704567_3"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-61511-3_101","volume-title":"Automated Deduction - Cade-13","author":"A. Middeldorp","year":"1996","unstructured":"Middeldorp, A., Ohsaki, H., Zantema, H.: Transforming Termination by Self-Labelling. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 373\u2013387. Springer, Heidelberg (1996)"},{"key":"3_CR14","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. Marche","year":"1998","unstructured":"Marche, 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":"3_CR15","unstructured":"Nakamura, M., Kusakari, K., Toyama, Y.: On Proving Termination by General Dummy Elimination. To appear in Trans. of IEICE (in Japanese)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"Zantema, H.: Termination of Term Rewriting: Interpretation and Type Elimination. Journal of Symbolic Computation\u00a017, 23\u201350 (1994)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:13:27Z","timestamp":1556003607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/10704567_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}