{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:27Z","timestamp":1725663507616},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:07:46Z","timestamp":1330254466000},"page":"287-301","source":"Crossref","is-referenced-by-count":4,"title":["Computing linearizations using test sets"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Hofbauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"21_CR1","unstructured":"R. B\u00fcndgen. Term completion versus algebraic completion. Dissertation, Universit\u00e4t T\u00fcbingen (1991)."},{"key":"21_CR2","first-page":"59","volume":"355","author":"R. B\u00fcndgen","year":"1989","unstructured":"R. B\u00fcndgen and W. K\u00fcchlin. Computing ground reducibility and inductively complete positions. Proc. 3rd RTA, LNCS Vol. 355 (1989), 59\u201375.","journal-title":"Proc. 3rd RTA, LNCS"},{"key":"21_CR3","unstructured":"H. Comon. Unification et disunification. Th\u00e9ories et applications. Th\u00e8se de Doctorat d'Universit\u00e9, Institut Polytechnique de Grenoble (1988)."},{"key":"21_CR4","doi-asserted-by":"crossref","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. Theoretical Computer Science 37 (1985), 123\u2013150.","journal-title":"Theoretical Computer Science"},{"key":"21_CR5","unstructured":"D. Hofbauer and M. Huber. Typical terms and test sets. Unpublished (1992)."},{"key":"21_CR6","volume-title":"Diplomarbeit","author":"M. Huber","year":"1991","unstructured":"M. Huber. Testmengen f\u00fcr Grundreduzierbarkeit: Konstruktionen, Komplikationen, Korollare. Diplomarbeit, Technische Universit\u00e4t Berlin (1991)."},{"key":"21_CR7","unstructured":"J.-P. Jouannaud and E. Kounalis. Proof by induction in equational theories without constructors. Proc. 1st LICS (1986), 358\u2013366."},{"key":"21_CR8","first-page":"99","volume":"230","author":"D. Kapur","year":"1986","unstructured":"D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. Proc. 8th CADE, LNCS Vol. 230 (1986), 99\u2013117.","journal-title":"Proc. 8th CADE, LNCS"},{"key":"21_CR9","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 (1987), 395\u2013415.","journal-title":"Acta Informatica"},{"key":"21_CR10","first-page":"221","volume":"431","author":"E. Kounalis","year":"1990","unstructured":"E. Kounalis. Testing for inductive (co)-reducibility. Proc. 15th CAAP, LNCS Vol. 431 (1990), 221\u2013238.","journal-title":"Proc. 15th CAAP, LNCS"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"E. Kounalis. Testing for the ground (co)-reducibility property in term rewriting systems. Revised version (1991), to appear.","DOI":"10.1016\/0304-3975(92)90279-O"},{"key":"21_CR12","first-page":"299","volume":"488","author":"G. A. Kucherov","year":"1991","unstructured":"G. A. Kucherov. On relationship between term rewriting systems and regular tree languages. Proc. 4th RTA, LNCS Vol. 488 (1991), 299\u2013311.","journal-title":"Proc. 4th RTA, LNCS"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"G. A. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. This volume (1992).","DOI":"10.1007\/3-540-56393-8_20"},{"key":"21_CR14","first-page":"301","volume":"3","author":"J.-L. Lassez","year":"1987","unstructured":"J.-L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning 3 (1987), 301\u2013317.","journal-title":"Journal of Automated Reasoning"},{"key":"21_CR15","first-page":"257","volume":"145","author":"T. Nipkow","year":"1983","unstructured":"T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. Proc. 6th GI Conf., LNCS Vol. 145 (1983), 257\u2013268.","journal-title":"Proc. 6th GI Conf., LNCS"},{"issue":"2\/3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. A. Plaisted","year":"1985","unstructured":"D. A. Plaisted. Semantic confluence tests and completion methods. Information and Control 65(2\/3) (1985), 182\u2013215.","journal-title":"Information and Control"},{"key":"21_CR17","unstructured":"S. V\u00e1gv\u00f6lgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. Unpublished (1992)."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:35Z","timestamp":1605647015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}