{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:37Z","timestamp":1725456217296},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012855","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:12:39Z","timestamp":1132708359000},"page":"538-549","source":"Crossref","is-referenced-by-count":24,"title":["Canonical conditional rewrite systems"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[]},{"given":"Mitsuhiro","family":"Okada","sequence":"additional","affiliation":[]},{"given":"G.","family":"Sivakumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"\u201cConditional rewrite rules: Confluence and termination\u201d, Report IW 198\/82 MEI","year":"1982","author":"J. A. Bergstra","key":"36_CR1","unstructured":"Bergstra, J. A., and Klop, J. W., \u201cConditional rewrite rules: Confluence and termination\u201d, Report IW 198\/82 MEI, Mathematische Centrum, Amsterdam, 1982."},{"key":"36_CR2","first-page":"323","volume":"32","author":"J. A. Bergstra","year":"1986","unstructured":"Bergstra, J. A., and Klop, J. W. \u201cConditional rewrite rules: confluency and termination\u201d, JCSS 32 pp. 323\u2013362, 1986.","journal-title":"JCSS"},{"key":"36_CR3","unstructured":"Brand, D., Darringer, J. A., Joyner, W. J. \u201cCompleteness of conditional reductions\u201d. Report RC 7404, IBM Thomas J. Watson Research Center, December 1978."},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N. \u201cOrderings for term-rewriting systems\u201d. Theoretical Computer Science 17(3), pp. 279\u2013301 (March 1982).","journal-title":"Theoretical Computer Science"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., and Okada, M. \u201cProof-theoretic techniques for term rewriting theory\u201d. Proceedings of the third annual Symposium on Logic in Computer Science, Edinburgh, July 1988 (to appear).","DOI":"10.1109\/LICS.1988.5108"},{"volume-title":"First International Workshop on Conditional Rewriting Systems","year":"1987","author":"N. Dershowitz","key":"36_CR6","unstructured":"Dershowitz, N., Okada, M., and Sivakumar, G. \u201cConfluence of Conditional Rewrite Systems\u201d. First International Workshop on Conditional Rewriting Systems, Orsay, France (July 1987) (to appear in Lecture Notes in Computer Science, Springer, Berlin)."},{"key":"36_CR7","unstructured":"Dershowitz, N., and Plaisted, D. A. \u201cLogic programming cum applicative programming\u201d. Proceedings of the 1985 Symposium on Logic Programming, Boston, MA, pp. 54\u201366 (July 1985)."},{"key":"36_CR8","unstructured":"Dershowitz, N., and Plaisted, D. A. \u201cEquational programming\u201d. In: Machine Intelligence 11, J. E. Hayes, D. Michie and J. Richards, eds., 1987 (to appear)."},{"key":"36_CR9","unstructured":"Fribourg, L. \u201cSlog: A logic programming language interpreter based on clausal superposition and rewriting\u201d. Proceedings of the 1985 Symposium on Logic Programming, Boston, MA (July 1985), pp. 172\u2013184."},{"key":"36_CR10","first-page":"295","volume-title":"Logic Programming: Functions, relations and equations","author":"J. A. Goguen","year":"1986","unstructured":"Goguen, J. A., and Meseguer, J. \u201cEqlog: Equality, types and generic modules for logic programming\u201d. In Logic Programming: Functions, relations and equations (D. DeGroot and G. Lindstrom, eds.), Prentice-Hall, Englewood Cliffs, NJ, pp. 295\u2013363, 1986."},{"key":"36_CR11","unstructured":"Jouannaud, J. P., and Waldmann, B. \u201cReductive Conditional term rewriting systems\u201d. Proceedings of the Third IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark."},{"key":"36_CR12","unstructured":"Kaplan, S. \u201cFair conditional term rewriting systems: Unification, termination and confluency\u201d, Laboratoire de Recherche en Informatique, Universit\u00e9 de Paris-Sud, Orsay, France, November 1984."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Kaplan, S. \u201cSimplifying conditional term rewriting systems: Unification, termination and confluence\u201d, Journal of Symbolic Computation (to appear).","DOI":"10.1016\/S0747-7171(87)80010-X"},{"key":"36_CR14","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Knuth, D. E., and Bendix, P. B. \u201cSimple word problems in universal algebras\u201d. In: Computational Problems in Abstract Algebra, J. Leech, ed. Pergamon Press, Oxford, U. K., 1970, pp. 263\u2013297."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Okada, M. \u201cA logical analysis for theory of conditional rewriting\u201d. First International Workshop on Conditional Rewriting Systems, Orsay, France (July 1987) (to appear in Lecture Notes in Computer Science, Springer, Berlin).","DOI":"10.1007\/3-540-19242-5_14"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Okada, M. and Takeuti, G. \u201cOn the theory of quasi-ordinal diagrams\u201d, in Logic and Combinatorics, ed. S.Simpson, Contemporary Mathematics 68 (1987), American Mathematical Society.","DOI":"10.1090\/conm\/065\/891255"},{"key":"36_CR17","unstructured":"R\u00e9my J.-L., \u201cEtude des syst\u00e8mes de r\u00e9\u00e9criture conditionnels et applications aux types abstraits alg\u00e9briques\u201d Th\u00e8se, Institut National Polytechnique de Lorraine, July 1982."},{"volume-title":"First International Workshop on Conditional Rewriting Systems","year":"1987","author":"Y. Toyama","key":"36_CR18","unstructured":"Toyama, Y. \u201cTerm rewriting systems with membership conditions\u201d. First International Workshop on Conditional Rewriting Systems, Orsay, France (July 1987) (to appear in Lecture Notes in Computer Science, Springer, Berlin)."}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:24:35Z","timestamp":1586564675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":18,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0012855","relation":{},"subject":[]}}