{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:38Z","timestamp":1725663518451},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540192428"},{"type":"electronic","value":"9783540391661"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19242-5_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:04:25Z","timestamp":1330182265000},"page":"179-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A logical analysis on theory of conditional rewriting"],"prefix":"10.1007","author":[{"given":"Mitsuhiro","family":"Okada","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"14_CR1","unstructured":"Bachmair, N. Dershowitz and J. Hsiang, \u201cOrderings for equational proofs.\u201d Proceedings of the Symposium on Logic in Computer Science, Cambridge, MA, 346\u2013357, June 1986."},{"key":"14_CR2","volume-title":"\u201cConditional rewrite rules: Confluence and termination\u201d, Report IW 198\/82 MEI","author":"J. A. Bergstra","year":"1982","unstructured":"Bergstra, J.A. and W. Klop, \u201cConditional rewrite rules: Confluence and termination\u201d, Report IW 198\/82 MEI, Mathematische Centrum, Amsterdam, 1982."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","volume":"9","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., \u201cA note on simplification orderings,\u201d, Inf. Proc. Lett. 9, 212\u2013215, 1979.","journal-title":"Inf. Proc. Lett."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N. and Z. Manna, \u201cProving termination with multiset orderings,\u201d Commun. ACM 22, 465\u2013476, 1979.","journal-title":"Commun. ACM"},{"key":"14_CR5","unstructured":"Dershowitz, N. and M. Okada, \u201cProof theoretic techniques for conditional rewrite systems,\u201d Proceedings of the Third Annual Symposium on Logic in Computer Science, Edinburgh, July 1988. To appear."},{"key":"14_CR6","unstructured":"Dershowitz, N. and D.A. Plaisted, \u201cEquational programming,\u201d in Machine Intelligence,\u201d 1987."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., M. Okada and G. Sivakumar, \u201cConfluence of conditional term rewriting systems,\u201d Proceedings of Workshop on Conditional Rewrite Systems, Orsay, France, July 1987.","DOI":"10.1007\/3-540-19242-5_3"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G., \u201cConfluent reductions: Abstract properties and applications to term rewriting systems,\u201d J. Assoc. Comp. Mach. 27, 797\u2013821, 1980. (Previous version in Proceedings of the Symposium on Foundations of Computer Science, Providence, RI, 30\u201345, (October 1977)).","journal-title":"J. Assoc. Comp. Mach."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"Huet, G. and D.C. Oppen, \u201cEquations and rewrite rules: A survey,\u201d in Formal Language Theory: Perspectives and Open Problems, ed. R. Book, Academic Press, New York, 349\u2013405, 1980."},{"key":"14_CR10","unstructured":"Jouannaud, J.P. and B. Waldmann, \u201cReductive conditional term rewriting systems,\u201d Proc. of the Third IFIP Working Conference on Formal Description of Programming Concept, 1986."},{"key":"14_CR11","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. \u201cConditional rewrite rules,\u201d Theoretical Computer Science 33, 175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"key":"14_CR12","volume-title":"Fair conditional term rewriting systems: Unification, termination and confluency","author":"S. Kaplan","year":"1984","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":"14_CR13","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Knuth, D.E. and P.B. Bendix, \u201cSimple word problems in universal algebras. In: (Leech, J., ed.) Computational Problems in Abstract Algebra, 263\u2013297, Oxford: Pergamon Press, 1970."},{"key":"14_CR14","unstructured":"Okada, M., \u201cOrdering structures of term-rewriting theory and theory of proof theoretic ordinals,\u201d Report 86 SF 20-1, Information Processing Society of Japan, 1\u20138, 1987."},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1017\/S0022481200029625","volume":"52","author":"M. Okada","year":"1987","unstructured":"Okada, M. \u201cA simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams,\u201d Journal of Symbolic Logic 52, 577\u2013581, 1987.","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/conm\/065\/891255","volume":"65","author":"M. Okada","year":"1987","unstructured":"Okada, M. and G. Takeuti, \u201cOn the theory of quasi-ordinal diagrams,\u201d in Logic and Combinatorics, ed. S. Simpson, Contemporary Mathematics 65, 295\u2013308, 1987.","journal-title":"Logic and Combinatorics"},{"key":"14_CR17","volume-title":"Report on conditional rewrite systems","author":"M. Okada","year":"1987","unstructured":"Okada, M., \u201cReport on conditional rewrite systems,\u201d (unpublished), Department of Computer Science, University of Illinois, Urbana, IL, May 1987."},{"key":"14_CR18","unstructured":"R\u00e9my, J.L. and H. Zhang, \u201cReveur 4: a system for validating conditional algebraic specifications of abstract data types,\u201d Report 54506, Centre de Recherche en Informatique de Nancy, France, 1984."},{"key":"14_CR19","first-page":"46","volume-title":"Contextual rewriting","author":"H. Zhang","year":"1985","unstructured":"Zhang, H. and J.L. R\u00e9my, \u201cContextual rewriting,\u201d Proceedings of First International Conference on Rewriting Techniques and Applications, Dijon, France (May 1985), Lecture Notes in Computer Science 202, Springer, Berlin, 46\u201362, 1985."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19242-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:05:43Z","timestamp":1578517543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19242-5_14"}},"subtitle":["Preliminary report"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540192428","9783540391661"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-19242-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}