{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:47Z","timestamp":1725455927523},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013833","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"291-305","source":"Crossref","is-referenced-by-count":2,"title":["A fast algorithm for ground normal form analysis"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"B\u00fcndgen","sequence":"first","affiliation":[]},{"given":"Hasko","family":"Eckhardt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen and Wolfgang K\u00fcchlin. Computing ground reducibility and inductively complete positions. In Nachum Dershowitz, editor, Rewriting Techniques and Applications (LNCS 355), pages 59\u201375, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_100"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Reinhard B\u00fcndgen. Applying term rewriting methods to finite groups. In H. Kirchner and W. Wechler, editors, Algebraic and Logic Programming (LNCS 463), Springer-Verlag, 1990.","DOI":"10.1007\/3-540-53162-9_49"},{"key":"19_CR3","volume-title":"Technical Report 91-5","author":"R. B\u00fcndgen","year":"1991","unstructured":"Reinhard B\u00fcndgen. The ReDuX System Documentation. Technical Report 91-5, Wilhelm-Schickard-Institut, Universit\u00e4t T\u00fcbingen, D-7400 T\u00fcbingen, 1991."},{"key":"19_CR4","volume-title":"PhD thesis","author":"R. B\u00fcndgen","year":"1991","unstructured":"Reinhard B\u00fcndgen. Term Completion Versus Algebraic Completion. PhD thesis, Universit\u00e4t T\u00fcbingen, D-7400 T\u00fcbingen, Germany, May 1991. (reprinted as report WSI 91-3)."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Hubert Comon. An effective method for handling initial algebras. In J. Grabowski, P. Lescanne, and W. Welcher, editors, Algebraic and Logic Programming (LNCS 343), Springer-Verlag, 1988.","DOI":"10.1007\/3-540-50667-5_62"},{"key":"19_CR6","unstructured":"Hasko Eckhardt. Grundterm-Analyse: Algorithmen und Erweiterungen. Master's thesis, Universit\u00e4t T\u00fcbingen, 1991."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Huet and Jean-Marie Hullot. Proofs by induction in equational theories with constructors. In Proc. 21st FoCS, pages 96\u2013107, Los Angeles, CA, 1980.","DOI":"10.1109\/SFCS.1980.37"},{"key":"19_CR8","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1979."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","volume":"82","author":"J. Jouannaud","year":"1989","unstructured":"Jean-Pierre Jouannaud and Emmanuel Kounalis. Proofs by induction in equational theories without constructors. Information and Computation, 82:1\u201333, 1989.","journal-title":"Information and Computation"},{"key":"19_CR10","unstructured":"Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, Pergamon Press, 1970."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Deepak Kapur, Paliath Narendran, and Hantao Zhang. Proof by induction using test sets. In J. Siekmann, editor, 8th International Conference on Automated Deduction (LNCS 230), pages 99\u2013117, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16780-3_83"},{"issue":"4","key":"19_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D. Kapur","year":"1987","unstructured":"Deepak Kapur, Paliath Narendran, and Hantao Zhang. On sufficientcompleteness and related properties of term rewriting systems. Acta Informatica, 24(4):395\u2013415, 1987.","journal-title":"Acta Informatica"},{"issue":"1","key":"19_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0747-7171(08)80133-2","volume":"11","author":"D. Kapur","year":"1991","unstructured":"Deepak Kapur, Paliath Narendran, and Hantao Zhang. Automating inductionless induction using test sets. Journal of Symbolic Computation, 11(1 & 2):83\u2013111, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR14","first-page":"221","volume-title":"CAAP'85 (LNCS 204)","author":"E. Kounalis","year":"1990","unstructured":"Emmanuel Kounalis. Testing for inductive (co)-reducibility. In A. Arnold, editor, CAAP'85 (LNCS 204), pages 221\u2013238, Springer-Verlag, 1990. Denmark)."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Grigori A. Kucherov. A new quasi-reducibility testing algorithm and its application to proofs by induction. In J. Grabowski, P. Lescanne, and W. Welcher, editors, Algebraic and Logic Programming (LNCS 343), Springer-Verlag, 1988.","DOI":"10.1007\/3-540-50667-5_72"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Grigori A. Kucherov. On relationship between term rewriting systems and regular tree languages. In Ronald V. Book, editor, Rewriting Techniques and Applications (LNCS 488), Springer-Verlag, 1991.","DOI":"10.1007\/3-540-53904-2_105"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"65","author":"D. Plaisted","year":"1985","unstructured":"David Plaisted. Semantic confluence and completion methods. Information and Control, 65:182\u2013215, 1985.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013833.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:08:11Z","timestamp":1607353691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0013833","relation":{},"subject":[]}}