{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:14:07Z","timestamp":1672254847021},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7596,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0743-1066(92)90050-d","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:13:42Z","timestamp":1034277222000},"page":"155-180","source":"Crossref","is-referenced-by-count":14,"title":["On rewrite programs: Semantics and relationship with prolog"],"prefix":"10.1016","volume":"14","author":[{"given":"Maria Paola","family":"Bonacina","sequence":"first","affiliation":[]},{"given":"Jieh","family":"Hsiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90050-D_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the Theory of Logic Programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(92)90050-D_BIB2","first-page":"353","article-title":"On the Safe Termination of Prolog Programs","author":"Apt","year":"1989","journal-title":"Proceedings of the Sixth International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90050-D_BIB3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-52531-9_132","article-title":"On the Power of Subsumption and Context Checks","author":"Bol","year":"1990","journal-title":"Proceedings of the International Symposium on Design and Implementation of Symbolic Computations Systems"},{"key":"10.1016\/0743-1066(92)90050-D_BIB4","first-page":"136","article-title":"HOPE: An Experimental Applicative Language","author":"Burstall","year":"1980","journal-title":"Conference Record of the 1980 LISP Conference"},{"key":"10.1016\/0743-1066(92)90050-D_BIB5","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0743-1066(92)90050-D_BIB6","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/65979.65984","article-title":"Functional Computations in Logic Programs","volume":"11","author":"Debray","year":"1989","journal-title":"ACM Transact. Programming Lang. Syst."},{"key":"10.1016\/0743-1066(92)90050-D_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for Term Rewriting Systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(92)90050-D_BIB8","first-page":"940","article-title":"Associative-Commutative Rewriting","author":"Dershowitz","year":"1983","journal-title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(92)90050-D_BIB9","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","article-title":"Computing with Rewrite Systems","volume":"65","author":"Dershowitz","year":"1985","journal-title":"Information and Control"},{"key":"10.1016\/0743-1066(92)90050-D_BIB10","first-page":"313","article-title":"Logic Programming by Completion","author":"Dershowitz","year":"1984","journal-title":"Proceedings of the Second International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90050-D_BIB11","series-title":"Machine Intelligence 11: The Logic and Acquisition of Knowledge","first-page":"21","article-title":"Equational Programming","author":"Dershowitz","year":"1988"},{"key":"10.1016\/0743-1066(92)90050-D_BIB12","first-page":"14","article-title":"A Maximal-Literal Unit Strategy for Horn Clauses","author":"Dershowitz","year":"1990","journal-title":"Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems"},{"key":"10.1016\/0743-1066(92)90050-D_BIB13","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985","journal-title":"Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(92)90050-D_BIB14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","article-title":"Equality, Types, Modules and (Why Not?) Generics for Logic Programming","volume":"1","author":"Goguen","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90050-D_BIB15","series-title":"Ph.D. Dissertation","article-title":"The Application of Theorem-Proving to Question-Answering","author":"Green","year":"1969"},{"key":"10.1016\/0743-1066(92)90050-D_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/357153.357158","article-title":"Programming with Equations","volume":"4","author":"Hoffmann","year":"1982","journal-title":"ACM Transact. Programming Lang. Syst."},{"key":"10.1016\/0743-1066(92)90050-D_BIB17","first-page":"733","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"4","author":"Kowalski","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(92)90050-D_BIB18","series-title":"Automatic Theorem Proving Project","article-title":"Canonical inference","author":"Lankford","year":"1975"},{"key":"10.1016\/0743-1066(92)90050-D_BIB19","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(92)90050-D_BIB20","series-title":"Proceedings of the First International Conference on Rewrite Techniques and Applications","article-title":"NARROWER: A New Algorithm for Unification and Its Application to Logic Programming","author":"Rety","year":"1985"},{"key":"10.1016\/0743-1066(92)90050-D_BIB21","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","article-title":"Automated Theorem Proving with Simplifiers, Commutativity, and Associativity","volume":"21","author":"Slagle","year":"1974","journal-title":"J. ACM"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669290050D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669290050D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T09:25:37Z","timestamp":1554974737000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669290050D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["074310669290050D"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90050-d","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}