{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T02:31:18Z","timestamp":1673490678044},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00291-9","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T05:34:35Z","timestamp":1075959275000},"page":"255-270","source":"Crossref","is-referenced-by-count":14,"title":["A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation"],"prefix":"10.1016","volume":"59","author":[{"given":"Kiyoshi","family":"Akama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekawit","family":"Nantajeewarawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidekatsu","family":"Koike","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB1","unstructured":"Akama K., Shigeta Y., and Miyamoto E., Solving Problems by Equivalent Transformation of Logic Programs, in Proceedings of the Fifth International Conference on Information Systems Analysis and Synthesis (ISAS'99), Orlando, Florida, 1999."},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB2","first-page":"395","article-title":"Equivalent Transformation for Equality Constraints on Multiset Domains (in Japanese)","volume":"13","author":"Akama","year":"1998","journal-title":"Journal of the Japanese Society for Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB3","unstructured":"Akama K., Koike H., and Miyamoto E., Program Synthesis from a Set of Definite Clauses and a Query, in Proceedings of the Fifth International Conference on Information Systems Analysis and Synthesis (ISAS'99), Orlando, Florida, 1999."},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB4","unstructured":"Akama K., Okada K., and Miyamoto E., A Foundation of Equivalent Transformation of Negative Constraints on String Domains (in Japanese), IEICE Technical Report, SS97-91, pp. 33\u201340, 1998."},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB5","series-title":"\u201cFoundations of Logic Programming\u201d","author":"Lloyd","year":"1987"},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB6","series-title":"\u201cHandbook of Logic in Artificial Intelligence and Logic Programming\u201d Vol. 5","first-page":"163","article-title":"Proof Procedures for Logic Programming","author":"Loveland","year":"1998"},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB7","unstructured":"Nantajeewarawat E., Akama K., and Koike H., Expanding Transformation as a Basis for Correctness of Rewriting Rules, in Proceedings of the Second International Conference on Intelligent Technologies (InTech'01), Bangkok, Thailand, 2001."},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","article-title":"Transformation of Logic Programs: Foundations and Techniques","volume":"19\/20","author":"Pettorossi","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB9","first-page":"697","article-title":"Transformation of Logic Programs","volume":"Vol. 5","author":"Pettorossi","year":"1998"},{"key":"10.1016\/S1571-0661(04)00291-9_NEWBIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"Journal of the ACM"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002919?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002919?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T01:58:06Z","timestamp":1550195886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002919"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00291-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}