{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:42Z","timestamp":1725663522483},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540192428"},{"type":"electronic","value":"9783540391661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19242-5_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:04:43Z","timestamp":1330200283000},"page":"245-248","source":"Crossref","is-referenced-by-count":1,"title":["TRSPEC: A term rewriting based system for algebraic specifications"],"prefix":"10.1007","author":[{"given":"J.","family":"Avenhaus","sequence":"first","affiliation":[]},{"given":"R.","family":"G\u00f6bel","sequence":"additional","affiliation":[]},{"given":"B.","family":"Gramlich","sequence":"additional","affiliation":[]},{"given":"K.","family":"Madlener","sequence":"additional","affiliation":[]},{"given":"J.","family":"Steinbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"18_CR1","unstructured":"Adler, C.: Vervollst\u00e4ndigung von Termersetzungsystemen modulo einer gleichungsdefinierten Theorie, Diplomarbeit, FB Informatik, Universit\u00e4t Kaiserslautern, 1987"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Avenhaus, J., Benninghofen, B., G\u00f6bel, R., Madlener, K.: TRSPEC: A Term Rewriting Based System for Algebraic Specifications, Proc. 8th CADE, Oxford, England, 1986","DOI":"10.1007\/3-540-16780-3_129"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cherifa, A.B., Lescanne, P.: An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations, 8th CADE, Oxford, England, 1986","DOI":"10.1007\/3-540-16780-3_78"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Fribourg, L.: A strong restriction of the inductive completion procedure, Proc. 13th ICALP, Rennes, France, 1986","DOI":"10.1007\/3-540-16761-7_60"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Ganzinger, H.: Ground term confluence in parametric conditional equational specifications, Proc. STACS '87, Passau, West Germany, 1987","DOI":"10.1007\/BFb0039613"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Gnaedig, I., Lescanne, P.: Proving termination of associative commutative rewriting systems by rewriting, Proc. 8th CADE, Oxford, England, 1986","DOI":"10.1007\/3-540-16780-3_79"},{"key":"18_CR7","unstructured":"G\u00f6bel, R.: A Completion Procedure for Globally Finite Term Rewriting Systems, Proceedings of a NSF Workshop on the Rewrite Rule Laboratory, General Electric, Schenectady, USA, 1983"},{"key":"18_CR8","unstructured":"G\u00f6bel, R.: Rewrite Rules with Conditions for Algebraic Specifications, Proc. of 2nd Workshop on Theory and Applications of Abstract Data Types (Abstract), Passau, West Germany, 1983"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"G\u00f6bel, R.: Completion of Globally Finite TRSs for Inductive Proofs, Proc.of GWAI 85, Springer Lecture Notes, 1985","DOI":"10.1007\/978-3-642-71145-9_7"},{"key":"18_CR10","unstructured":"G\u00f6bel, R.: A Specialized Knuth-Bendix Algorithm for Inductive Proofs, Proc. Combinatorial Algorithms in Algebraic Structures, Universit\u00e4t Kaiserslautern, 1985"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f6bel, R.: Ground Confluence, Proc. 2nd Int. Conf. on Rewriting Techniques and Applications, Springer LNCS, Bordeaux, France, 1987","DOI":"10.1007\/3-540-17220-3_14"},{"key":"18_CR12","unstructured":"G\u00f6bel, R.: Completion Methods for Obtaining Ground Confluent Rule Systems and their Applications for Inductive Proofs, Dissertation, FB Informatik, Universit\u00e4t Kaiserslautern, 1987"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Huet, G., Hullot, J.: Proofs by Induction in Equational Theories with Constructors, JACM 25(2), 1982","DOI":"10.1016\/0022-0000(82)90006-X"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.P., Kirchner, H.: Completion of a Set of Rules Modulo a Set of Equations, 11th Symp. on Principles of Programming Languages, Salt Lake City, Utah, USA, 1984","DOI":"10.1145\/800017.800519"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"Kaplan, S.: Conditional Rewrite Rules, Theoretical Computer Science 33, pp. 175\u2013193, 1984","journal-title":"Theoretical Computer Science"},{"key":"18_CR16","unstructured":"K\u00fcchlin, W.: Inductive Completion by Ground Proof Transformation, Tech. Rep. 87-08, Dept. of Computer and Information Sciences, Univ. of Delaware, 1987"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Musser, D.R.: Proving inductive properties of abstract data types, Proc. of 7th POPL, Las Vegas, Nevada, 1980","DOI":"10.1145\/567446.567461"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"M\u00fcller, J., Wagner, E.: Effiziente Reduktionsstrategien in Termersetzungssytemen, GWAI 86, Springer IFB 124, 1986","DOI":"10.1007\/978-3-642-71385-9_25"},{"key":"18_CR19","unstructured":"M\u00fcller, J.: THEOPOGLES: A Theorem Prover for First Order Logic Based on Rewriting Techniques, Proc. GWAI 87, to appear"},{"key":"18_CR20","unstructured":"R\u00e9my, J.L.: Etude des Syst\u00e8mes de R\u00e9\u00e9criture Conditionnelle et des Applications aux Types Abstraits, Th\u00e8se de 3\u00e8me cycle, France, 1982"},{"key":"18_CR21","unstructured":"Sattler-Klein, A.: Ein benutzerfreundliches Testsystem f\u00fcr Reduktionsstrategien auf W\u00f6rtern, Projektarbeit, FB Informatik, Universit\u00e4t Kaiserslautern, 1985"},{"key":"18_CR22","unstructured":"Sattler-Klein, A.: Minimierung der kritischen Paare imVervollst\u00e4ndigungssystem COSY, Diplomarbeit, FB Informatik, Universit\u00e4t Kaiserslautern, 1987"},{"key":"18_CR23","unstructured":"Steinbach, J.: Ordnungen f\u00fcr Termersetzungssysteme, Diplomarbeit, FB Informatik, Universit\u00e4t Kaiserslautern, 1986"},{"key":"18_CR24","unstructured":"Wagner, E.: Strategien f\u00fcr den Knuth-Bendix Algorithmus, Diplomarbeit, FB Informatik, Universit\u00e4t Kaiserslautern, 1986"}],"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-19242-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:50Z","timestamp":1605644210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19242-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540192428","9783540391661"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-19242-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}