{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T23:51:30Z","timestamp":1672617090704},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90032-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"133-146","source":"Crossref","is-referenced-by-count":7,"title":["On completeness of narrowing strategies"],"prefix":"10.1016","volume":"72","author":[{"given":"Rachid","family":"Echahed","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90032-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\/0304-3975(90)90032-D_BIB2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","article-title":"The relation between logic and functional languages: A survey","author":"Bellia","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(90)90032-D_BIB3","series-title":"Proc. ESOP '86","first-page":"119","article-title":"Design and implementation of a generic, logic and functional programming language","volume":"213","author":"Bert","year":"1986"},{"key":"10.1016\/0304-3975(90)90032-D_BIB4","series-title":"Proc. TAPSOFT '87","first-page":"276","article-title":"Refined strategies for semantic unification","volume":"250","author":"Bosco","year":"1987"},{"key":"10.1016\/0304-3975(90)90032-D_BIB5","first-page":"54","article-title":"Logic programming cum applicative programming","author":"Dershowitz","year":"1985","journal-title":"Proc. of SLP '85"},{"key":"10.1016\/0304-3975(90)90032-D_BIB6","first-page":"161","article-title":"First order unification in an equational theory","author":"Fay","year":"1979","journal-title":"Proc. of the 4th Workshop on Automated Deduction"},{"key":"10.1016\/0304-3975(90)90032-D_BIB7","first-page":"172","article-title":"SLOG: a logic programming language interpreter based on clausal superposition and rewriting","author":"Fribourg","year":"1985","journal-title":"Proc. SLP '85"},{"key":"10.1016\/0304-3975(90)90032-D_BIB8","series-title":"Proc. ESOP '86","first-page":"339","article-title":"Experiences with the RAP system\u2014a specification interpreter combining term rewriting and resolution","volume":"213","author":"Geser","year":"1986"},{"key":"10.1016\/0304-3975(90)90032-D_BIB9","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\/0304-3975(90)90032-D_BIB10","series-title":"Proc. EUROCAL '85","first-page":"543","article-title":"Unification in conditional equational theories","volume":"204","author":"Hussmann","year":"1985"},{"key":"10.1016\/0304-3975(90)90032-D_BIB11","first-page":"96","article-title":"Proofs by induction in equational theories with constructors","author":"Huet","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90032-D_BIB12","series-title":"Formal Languages: Perspectives and Open problems","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(90)90032-D_BIB13","series-title":"Proc. 5th CADE","first-page":"318","article-title":"Canonical forms and unification","volume":"87","author":"Hullot","year":"1980"},{"key":"10.1016\/0304-3975(90)90032-D_BIB14","series-title":"Proc. SLP '86","first-page":"187","article-title":"An implementation of narrowing: the RITE way","author":"Josephson","year":"1986"},{"key":"10.1016\/0304-3975(90)90032-D_BIB15","article-title":"Automatic proofs by induction in equational theories without constructors","author":"Jouannaud","year":"1986","journal-title":"Proc. 1st IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(90)90032-D_BIB16","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\/0304-3975(90)90032-D_BIB17","series-title":"Algebraic Methods in Semantics","first-page":"459","article-title":"Initiality, induction and computability","author":"Meseguer","year":"1985"},{"key":"10.1016\/0304-3975(90)90032-D_BIB18","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0304-3975(90)90032-D_BIB19","series-title":"Seki-report","article-title":"Basic narrowing revisited","author":"Nutt","year":"1987"},{"key":"10.1016\/0304-3975(90)90032-D_BIB20","series-title":"Proc. RTA '87","first-page":"242","article-title":"Strategy-controlled reduction and narrowing","volume":"256","author":"Padawitz","year":"1987"},{"key":"10.1016\/0304-3975(90)90032-D_BIB21","series-title":"Logic Programming: Relations, Functions, and Equations","article-title":"Narrowing as the operational semantics of functional languages","author":"Reddy","year":"1985"},{"key":"10.1016\/0304-3975(90)90032-D_BIB22","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","article-title":"Automated theorem proving for theories with simplifiers, commutativity, and associativity","volume":"21","author":"Slagle","year":"1974","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090032D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090032D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:27Z","timestamp":1555127487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090032D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090032D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90032-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}