{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:44:59Z","timestamp":1762458299674,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4855,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004399","name":"Okawa Foundation for Information and Telecommunications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0304-3975(99)00210-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:59:23Z","timestamp":1027634363000},"page":"209-232","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Logicality of conditional rewrite systems"],"prefix":"10.1016","volume":"236","author":[{"given":"Toshiyuki","family":"Yamada","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Avenhaus","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Lor\u0131\u0301a-S\u00e1enz","sequence":"additional","affiliation":[]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00210-8_BIB1","unstructured":"J. Avenhaus, C. Lor\u0131\u0301a-S\u00e1enz, Canonical conditional rewrite systems containing extra variables, SEKI-Report SR-93-03, Universit\u00e4t Kaiserslautern, 1993."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB2","doi-asserted-by":"crossref","unstructured":"J. Avenhaus, C. Lor\u0131\u0301a-S\u00e1enz, On conditional rewrite systems with extra variables and deterministic logic programs, Proc. 5th Internat. Conf. on Logic Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence, vol. 822, Springer, Berlin, 1994, pp. 215\u2013229.","DOI":"10.1007\/3-540-58216-9_40"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB4","doi-asserted-by":"crossref","unstructured":"H. Bertling, H. Ganzinger, Completion-time optimization of rewrite-time goal solving, Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 355, Springer, Berlin, 1989, pp. 45\u201358.","DOI":"10.1007\/3-540-51081-8_99"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB5","first-page":"243","article-title":"Rewrite systems","volume":"vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud, J.W. Klop, Open problems in rewriting, Proc. 4th Internat. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 488, Springer, Berlin, 1991, pp. 445\u2013456.","DOI":"10.1007\/3-540-53904-2_120"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","article-title":"A rationale for conditional equational programming","volume":"75","author":"Dershowitz","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB8","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, M. Okada, G. Sivakumar, Canonical conditional rewrite systems, in: Proc. 9th Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 310, Springer, Berlin, 1988, pp. 538\u2013549.","DOI":"10.1007\/BFb0012855"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB9","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, U. Waldmann, Termination proofs of well-moded logic programs via conditional rewrite systems, Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science, vol. 656, Springer, Berlin, 1992, pp. 430\u2013437.","DOI":"10.1007\/3-540-56393-8_34"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB10","doi-asserted-by":"crossref","unstructured":"E. Giovannetti, C. Moiso, A completeness result for E-unification algorithms based on conditional narrowing, Proc. Workshop on Foundations of Logic and Functional Programming, Lecture Notes in Computer Science, vol. 306, Springer, Berlin, 1986, pp. 157\u2013167.","DOI":"10.1007\/3-540-19129-1_7"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB11","first-page":"1","article-title":"Equivalence of the quotient term model and the least complete herbrand model for a functional logic language","volume":"1","author":"Hamana","year":"1997","journal-title":"J. Funct. Logic Programm."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB12","doi-asserted-by":"crossref","unstructured":"M. Hanus, On extra variables in (Equational) logic programming, in: Proc. 12th Internat. Conf. on Logic Programming, MIT Press, Cambridge, 1995, pp. 665\u2013679.","DOI":"10.7551\/mitpress\/4298.003.0065"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","article-title":"Conditional rewrite rules","volume":"33","author":"Kaplan","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB14","first-page":"1","article-title":"Term rewriting systems","volume":"vol. II","author":"Klop","year":"1992"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","article-title":"Completeness results for basic narrowing","volume":"5","author":"Middeldorp","year":"1994","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB16","first-page":"189","article-title":"Universal algebra","volume":"vol. I","author":"Meinke","year":"1992"},{"key":"10.1016\/S0304-3975(99)00210-8_BIB17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF02945004","article-title":"Completeness of calculii for axiomatically defined classes of algebras","volume":"2","author":"Selman","year":"1972","journal-title":"Algebra Univ."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB18","unstructured":"T. Suzuki, Studies on conditional narrowing for rewrite systems with extra variables, Ph.D. Thesis, University of Tokyo, 1998."},{"key":"10.1016\/S0304-3975(99)00210-8_BIB19","doi-asserted-by":"crossref","unstructured":"T. Suzuki, A. Middeldorp, T. Ida, Level-confluence of conditional rewrite systems with extra variables in right-hand sides, Proc. 6th Internat. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 914, Springer, Berlin, 1995, pp. 179\u2013193.","DOI":"10.1007\/3-540-59200-8_56"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:51Z","timestamp":1759625511000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397599002108"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00210-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Logicality of conditional rewrite systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(99)00210-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}