{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:21Z","timestamp":1761611181400},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052368","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"151-165","source":"Crossref","is-referenced-by-count":40,"title":["Decidable approximations of sets of descendants and sets of normal forms"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Genet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In M. Bidoit and M. Dauchet, editors, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 261\u2013272. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0030602"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"T. Arts and J. Giesl. Proving innermost termination automatically. In Proc. 7th RTA Conf., Sitges (Spain), volume 1232 of LNCS, pages 157\u2013171. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62950-5_68"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proc. 8th CADE Conf., Oxford (UK), volume 230 of LNCS, pages 128\u2013140. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16780-3_85"},{"key":"13_CR4","unstructured":"H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and Tommasi. Tree automata techniques and applications. Preliminary Version, http:\/\/13ux02.univ-lille3.fr\/tata\/, 1997."},{"key":"13_CR5","unstructured":"H. Comon and J.-L. R\u00e9my. How to characterize the language of ground normal forms. Technical Report 676, INRIA-Lorraine, 1987."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"J. Coquid\u00e9, M. Dauchet, R. Gilleron, and S. Vagv\u00f6lgyi. Bottom-up tree pushdown automata and rewrite systems. In R. V. Book, editor, Proc. 4th RTA Conf., Como (Italy), volume 488 of LNCS, pages 287\u2013298. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-53904-2_104"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. 5th LICS Symp., Philadelphia (Pa., USA), pages 242\u2013248, June 1990.","DOI":"10.1109\/LICS.1990.113750"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz and C. Hoot. Natural termination. TCS, 142(2):179\u2013207, May 1995.","journal-title":"TCS"},{"key":"13_CR9","first-page":"244","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","volume":"37","author":"J. H. Gallier","year":"1985","unstructured":"J. H. Gallier and R. V. Book. Reductions in tree replacement systems. TCS, 37:123\u2013150, 1985.","journal-title":"TCS"},{"key":"13_CR11","volume-title":"Tree automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree automata. Akad\u00e9miai Kiad\u00f3, Budapest, Hungary, 1984."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"T. Genet. Decidable approximations of sets of descendants and sets of normal forms (extended version). Technical Report RR-3325, INRIA, 1997.","DOI":"10.1007\/BFb0052368"},{"key":"13_CR13","unstructured":"T. Genet. Proving termination of sequential reduction relation using tree automata. Technical Report 97-R-091, CRIN, 1997."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"T. Genet and I. Gnaedig. Termination proofs using gpo ordering constraints. In M. Dauchet, editor, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 249\u2013260. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0030601"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proc. 7th RTA Conf., New Brunswick (New Jersey, USA), pages 362\u2013376. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61464-8_65"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D. Kapur","year":"1987","unstructured":"D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395\u2013415, 1987.","journal-title":"Acta Informatica"},{"key":"13_CR18","unstructured":"C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131\u2013158. The MIT press, 1995."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"E. Kounalis. Completeness in data type specifications. In B. Buchberger, editor, Proceedings EUROCAL Conference, Linz (Austria), volume 204 of LNCS, pages 348\u2013362. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15984-3_291"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(90)90221-I","volume":"34","author":"M. Kurihara","year":"1990","unstructured":"M. Kurihara and I. Kaji. Modular term rewriting systems and the termination. IPL, 34:1\u20134, Feb. 1990.","journal-title":"IPL"},{"issue":"3","key":"13_CR21","first-page":"357","volume":"14","author":"M. Kurihara","year":"1991","unstructured":"M. Kurihara and A. Ohuchi. Modular term rewriting systems with shared constructors. Journal of Information Processing of Japan, 14(3):357\u2013358, 1991.","journal-title":"Journal of Information Processing of Japan"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"S. Limet and P. R\u00e9ty. E-unification by means of tree tuple synchronized grammars. In M. Dauchet, editor, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 429\u2013440. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0030616"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of LNCS, pages 257\u2013268. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0009650"},{"key":"13_CR24","volume-title":"PhD thesis","author":"E. Ohlebusch","year":"1994","unstructured":"E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universit\u00e4t Bielefeld, Bielefeld, 1994."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. of Computer and System Sciences, 37:367\u2013394, 1988.","journal-title":"J. of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T09:14:00Z","timestamp":1586942040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0052368","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}