{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:24:59Z","timestamp":1725690299567},"publisher-location":"Wiesbaden","reference-count":30,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783519026464"},{"type":"electronic","value":"9783322912305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-322-91230-5_6","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T17:46:58Z","timestamp":1341424018000},"page":"95-113","source":"Crossref","is-referenced-by-count":0,"title":["Ph\u00e4nomene der Knuth-Bendix Vervollst\u00e4ndigung"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Sattler-Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Universit\u00e4t Kaiserslautern","author":"J Avenhaus","year":"1989","unstructured":"J. Avenhaus. Transforming infinite rewrite systems into finite rewrite systems by embedding techniques. SEKI-Report SR-89\u201321, Universit\u00e4t Kaiserslautern (1989)."},{"key":"6_CR2","first-page":"361","volume":"91","author":"J Avenhaus","year":"1981","unstructured":"J. Avenhaus. Proving equational and inductive theorems by completion and embedding techniques. In: Proc. RTA\u201991, Como (1991), 361\u2013373.","journal-title":"Proc. RTA"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1994.1056","volume":"112","author":"H Comon","year":"1994","unstructured":"H. Comon, C. Delor. Equational formulae with membership constraints. Information and Computation 112 (2) (1994), 167\u2013216.","journal-title":"Information and Computation"},{"key":"6_CR4","first-page":"20","volume":"91","author":"H Chen","year":"1981","unstructured":"H. Chen, J. Hsiang. Logic Programming in Recurrence domains. In: Proc. ICALP \u201881,Madrid (1991), 20\u201334.","journal-title":"Proc. ICALP"},{"key":"6_CR5","first-page":"37","volume":"90","author":"H Chen","year":"1981","unstructured":"H. Chen, J. Hsiang, H.-C. Kong. On finite representations of infinite sequences of terms. Preprint, Extended abstract in: Proc. CTRS \u201880,Montreal (1990), 37\u201344.","journal-title":"Proc. CTRS"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. In: Proc. ICALP \u201882,Wien (1992), 392\u2013403.","DOI":"10.1007\/3-540-55719-9_91"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01294596","volume":"28","author":"H Comon","year":"1995","unstructured":"H. Comon. On unification of terms with integer exponents. Mathematical Systems Theory 28 (1) (1995), 67\u201388.","journal-title":"Mathematical Systems Theory"},{"key":"6_CR8","first-page":"445","volume":"91","author":"N Dershowitz","year":"1981","unstructured":"N. Dershowitz, J.-P. Jouannaud, J.W. Klop. Open Problems in Rewriting. In: Proc. RTA \u201881,Como (1991), 445\u2013456.","journal-title":"Proc. RTA"},{"key":"6_CR9","first-page":"468","volume":"93","author":"N Dershowitz","year":"1981","unstructured":"N. Dershowitz, J.-P. Jouannaud, J.W. Klop. More Problems in Rewriting. In: Proc. RTA \u201883,Montreal (1993), 468\u2013487.","journal-title":"Proc. ALP"},{"key":"6_CR10","unstructured":"B. Gramlich: Unification of term schemes - Theory and Applications. SEKI-Report SR-88\u201318, Universit\u00e4t Kaiserslautern (1988)."},{"issue":"1","key":"6_CR11","first-page":"115","volume":"92","author":"M Hermann","year":"1981","unstructured":"M. Hermann. On the relation between primitive recursion, schematiza- tion, and divergence. In: Proc. ALP \u201882,Volterra (1992), 115\u2013127.","journal-title":"Proc. ALP"},{"key":"6_CR12","unstructured":"M. Hermann. Divergence des syst\u00e8me de r\u00e9\u00e9criture et sch\u00e9matisation des ensembles infinis de termes. Habilitation, Universit\u00e9 Henri Poincar\u00e9 Nancy I, 1994."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G Huet","year":"1981","unstructured":"G. Huet. A complete proof of correctness of the Knuth-Bendix completion algorithm. Journal Computer and System Science 23 (1) (1981), 11\u201321.","journal-title":"Journal Computer and System Science"},{"key":"6_CR14","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D Knuth","year":"1970","unstructured":"D. Knuth, P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, 263\u2013297. Pergamon Press, New York, 1970."},{"key":"6_CR15","unstructured":"H. Kirchner, M. Hermann. Computing meta-rules from crossed rewrite systems. Preprint, Extended abstract in: Proc. CTRS \u201880,Montreal (1990), 60."},{"issue":"23","key":"6_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","volume":"67","author":"H Kirchner","year":"1989","unstructured":"H. Kirchner. Schematization of infinite sets of rewrite rules generated by divergent completion process. Theoretical Computer Science 67 (2\u20133) (1989), 303\u2013332.","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","volume":"35","author":"D Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran. A finite Thue system with decidable word problem and without equivalent finite canonical system. Theoretical Computer Science 35 (1985), 337\u2013344.","journal-title":"Theoretical Computer Science"},{"key":"6_CR18","unstructured":"D. Kapur, H. Zhang. RRL: Rewrite Rule Laboratory - User\u2019s Manual, GE Corporate Research and Development Report, Schenectady, New York, 1987 (revised version: May 1989 )."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"S. Lange: Towards a set of inference rules for solving divergence in Knuth-Bendix completion. In: Proc. All \u201889,Reinhardsbrunn Castle (1989), 304\u2013316.","DOI":"10.1007\/3-540-51734-0_70"},{"key":"6_CR20","volume-title":"TH Leipzig","author":"S Lange","year":"1989","unstructured":"S. Lange, K.P. Jantke: Towards a learning calculus for solving divergence in Knuth-Bendix completion. Communications of the Algorithmic Learning Group, TH Leipzig (1989)."},{"key":"6_CR21","first-page":"953","volume":"77","author":"AA Markov","year":"1951","unstructured":"A.A. Markov. The impossibility of algorithms for recognizing some properties of associative systems. Doklady Akademii Nauk SSSR\n                77 (1951), 953\u2013956.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"F. Otto, A. Sattler-Klein. FDT is undecidable for finitely presented monoids with solvable word problems. In: Proc. FCT \u201887,Krakow (1997), to appear.","DOI":"10.1007\/BFb0036200"},{"key":"6_CR23","first-page":"409","volume-title":"Proc. LPAR 92","author":"G Salzer","year":"1992","unstructured":"G. Salzer. The unification of infinite sets of terms and its applications. In: Proc. LPAR \u201882, St. Petersburg (1992), 409\u2013420."},{"key":"6_CR24","volume-title":"Fachbereich Informatik","author":"A. Sattler-Klein. A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. Dissertation","year":"1996","unstructured":"A. Sattler-Klein. A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. Dissertation, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, Februar 1996."},{"key":"6_CR25","first-page":"68","volume":"97","author":"A Sattler-Klein","year":"1912","unstructured":"A. Sattler-Klein. New undecidability results for finitely presented monoids. In: Proc. RTA \u201887,Sitges (1997), 68\u201382.","journal-title":"Proc. RTA"},{"key":"6_CR26","unstructured":"J. Steinbach. Comparing on Strings: Iterated syllable ordering and recursive path orderings. SEKI-Report SR-89\u201315, Universit\u00e4t Kaiserslautern (1989)."},{"key":"6_CR27","first-page":"1","volume":"7","author":"A Thue","year":"1912","unstructured":"A. Thue. \u00dcber unendliche Zeichenreihen, Kra. Vidensk. Selsk. Skr. I. Mat. Nat. Kl., Christiana no. 7 (1906), 1\u201322.","journal-title":"Kra. Vidensk. Selsk. Skr. I. Mat. Nat. Kl., Christiana"},{"key":"6_CR28","first-page":"1","volume":"1","author":"A Thue","year":"1912","unstructured":"A. Thue. \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Kra. Vidensk. Selsk. Skr. I. Mat. Nat. Kl., Christiana no. 1 (1912), 1\u201367.","journal-title":"Vidensk. Selsk. Skr. I. Mat. Nat. Kl., Christiana"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"M. Thomas, K.P. Jantke: Inductive inference for solving divergence in Knuth-Bendix completion. In: Proc. All \u201889,Reinhardsbrunn Castle (1989), 288\u2013303.","DOI":"10.1007\/3-540-51734-0_69"},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(93)90241-K","volume":"112","author":"M Thomas","year":"1993","unstructured":"M. Thomas, P. Watson. Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science 112 (1) (1993), 145\u2013185.","journal-title":"Theoretical Computer Science"}],"container-title":["Ausgezeichnete Informatikdissertationen 1996"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-91230-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T20:45:20Z","timestamp":1619988320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-91230-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783519026464","9783322912305"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-91230-5_6","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}