{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:31Z","timestamp":1725664351342},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592006"},{"type":"electronic","value":"9783540492238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59200-8_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:07:34Z","timestamp":1330276054000},"page":"86-100","source":"Crossref","is-referenced-by-count":4,"title":["Towards an efficient construction of test sets for deciding ground reducibility"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Fettig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proc. 9 th STACS, volume 577 of LNCS, pages 161\u2013171. Springer, 1992.","DOI":"10.1007\/3-540-55210-3_181"},{"key":"8_CR2","volume-title":"Ph.D. thesis","author":"R. B\u00fcndgen","year":"1991","unstructured":"R. B\u00fcndgen. Term completion versus algebraic completion. Ph.D. thesis, Fakult\u00e4t f\u00fcr Informatik, Eberhard-Karls-Universit\u00e4t, T\u00fcbingen, Germany, May 1991."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"H. Comon and F. Jacquemard. Ground reducibility and automata with disequality constraints. In Proc. 11 th STACS, LNCS 775, pages 151\u2013162. Springer, 1994.","DOI":"10.1007\/3-540-57785-8_138"},{"key":"8_CR4","unstructured":"H. Comon and J.-L. Remy. How to characterize the language of ground normal forms. Rapports de Recherche 676, INRIA, 1987."},{"key":"8_CR5","first-page":"162","volume":"No. 43","author":"N. Dershowitz","year":"1991","unstructured":"N. Dershowitz and J.-P. Jouannaud. Notations for rewriting. Bulletin EATCS, No. 43, pages 162\u2013172, Feb 1991.","journal-title":"Bulletin EATCS"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jsco.1994.1005","volume":"17","author":"D. Hofbauer","year":"1994","unstructured":"D. Hofbauer and M. Huber. Linearizing term rewriting systems using test sets. Journal of Symbolic Computation, 17:91\u2013129, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","volume":"82","author":"J. Jouannaud","year":"1989","unstructured":"J. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82:1\u201333, July 1989. An earlier version of this paper appeared in Bulletin EATCS, No. 27, 1985, pages 49\u201355.","journal-title":"Information and Computation"},{"key":"8_CR8","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":"8_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0747-7171(08)80133-2","volume":"11","author":"D. Kapur","year":"1991","unstructured":"D. Kapur, P. Narendran, and H. Zhang. Automating inductionless induction using test sets. Journal of Symbolic Computation, 11:83\u2013111, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"E. Kounalis. Testing for inductive (co)-reducibility. In CAAP'90, Copenhagen, Denmark, volume 431 of LNCS, pages 221\u2013238, 1990.","DOI":"10.1007\/3-540-52590-4_51"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(92)90279-O","volume":"106","author":"E. Kounalis","year":"1992","unstructured":"E. Kounalis. Testing for the ground (co)-reducibility property in term-rewriting systems. Theoretical Computer Science, Elsevier, 106:87\u2013117, 1992.","journal-title":"Theoretical Computer Science, Elsevier"},{"key":"8_CR12","first-page":"272","volume":"656","author":"G. Kucherov","year":"1992","unstructured":"G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. In 3 rd CTRS, LNCS 656, pages 272\u2013286, 1992.","journal-title":"3rd CTRS, LNCS"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. Plaisted","year":"1985","unstructured":"D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182\u2013215, 1985.","journal-title":"Information and Control"},{"key":"8_CR14","first-page":"197","volume":"No. 48","author":"S. V\u00e1gv\u00f6lgyi","year":"1992","unstructured":"S. V\u00e1gv\u00f6lgyi and R. Gilleron. For a rewriting system it is decidable whether the set of irreducible ground terms is recognizable. Bulletin EATCS, No. 48, pages 197\u2013200, 1992.","journal-title":"Bulletin EATCS"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59200-8_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:56Z","timestamp":1605648356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59200-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592006","9783540492238"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-59200-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}