{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:45:03Z","timestamp":1757540703643},"reference-count":35,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":8904,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/s0747-7171(89)80015-x","type":"journal-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T09:11:51Z","timestamp":1213693911000},"page":"319-341","source":"Crossref","is-referenced-by-count":13,"title":["Enumerating outer narrowing derivationsfor constructor-based term rewriting systems"],"prefix":"10.1016","volume":"7","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(89)80015-X_bib1","series-title":"Proc. RTA '87","article-title":"On equational theories, unification and decidability","volume":"256","author":"Burckert","year":"1987"},{"key":"10.1016\/S0747-7171(89)80015-X_bib2","series-title":"HOPE user's manual","author":"Burstall","year":"1980"},{"key":"10.1016\/S0747-7171(89)80015-X_bib3","series-title":"Proc. International Symposium on Logic Programming","first-page":"54","article-title":"Logic programming cum applicative programming","author":"Dershowitz","year":"1985"},{"issue":"2\/3","key":"10.1016\/S0747-7171(89)80015-X_bib4","article-title":"Computing with rewrite rules","volume":"65","author":"Dershowitz","year":"1985","journal-title":"Information and Control"},{"issue":"3","key":"10.1016\/S0747-7171(89)80015-X_bib5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(87)90002-1","article-title":"Extended unification algorithms for the integration of functional programming into logic programming","volume":"4","author":"Dincbas","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0747-7171(89)80015-X_bib6","series-title":"proc. CAAP '83","first-page":"205","article-title":"Unification and matching in equational theories","volume":"159","author":"Fages","year":"1983"},{"key":"10.1016\/S0747-7171(89)80015-X_bib7","series-title":"Proc. 4th Workshop on Automated Deduction","first-page":"161","article-title":"First-order unification in an equational theory","author":"Fay","year":"1979"},{"key":"10.1016\/S0747-7171(89)80015-X_bib8","series-title":"Proc. Symposium on Logic Programming","first-page":"1985","article-title":"SLOG: A logic programming language interpreter based on clausal superposition and rewriting","author":"Fribourg","year":"1985"},{"key":"10.1016\/S0747-7171(89)80015-X_bib9","series-title":"Proc. RTA '87","first-page":"216","article-title":"A general complete E-unification procedure","volume":"256","author":"Gallier","year":"1987"},{"key":"10.1016\/S0747-7171(89)80015-X_bib10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","article-title":"Equality, types, modules and generics for logic programming","volume":"2","author":"Goguen","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0747-7171(89)80015-X_bib11","doi-asserted-by":"crossref","unstructured":"Herbrand, J. (1971). Sur la Th\u00e9orie de la D\u00e9monstration. In Logical Writings, W. Goldfarb (ed.), Cambridge.","DOI":"10.1007\/978-94-010-3072-4"},{"key":"10.1016\/S0747-7171(89)80015-X_bib12","series-title":"Computations in nonambiguous linear term rewriting systems (Part I and II)","author":"Huet","year":"1979"},{"key":"10.1016\/S0747-7171(89)80015-X_bib13","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/S0747-7171(89)80015-X_bib14","series-title":"Formal structures for computations and deduction. Course notes","author":"Huet","year":"1986"},{"key":"10.1016\/S0747-7171(89)80015-X_bib15","series-title":"A uniform approach to type theory","author":"Huet","year":"1987"},{"key":"10.1016\/S0747-7171(89)80015-X_bib16","series-title":"Proc. 5th Conference on Automated Deduction","first-page":"318","article-title":"Canonical forms and unification","author":"Hullot","year":"1980"},{"key":"10.1016\/S0747-7171(89)80015-X_bib17","unstructured":"Jouannaud, J.P., Kirchner, C., Kirchner, H. Incremental construction of unification procedures in equationaltheories. Proc. 10th ICALP, LNCS 154. Springer-Verlag"},{"key":"10.1016\/S0747-7171(89)80015-X_bib18","series-title":"Tech. Report ATP-32","article-title":"Canonical inference","author":"Lankford","year":"1975"},{"key":"10.1016\/S0747-7171(89)80015-X_bib19","doi-asserted-by":"crossref","unstructured":"Martelli, A., Montanari U. An efficient unification algorithm. ACM TOPLAS, 4, 2, pp. 258\u2013282.","DOI":"10.1145\/357162.357169"},{"key":"10.1016\/S0747-7171(89)80015-X_bib20","series-title":"Proc. 1986 International Symposium on Logic Programming","first-page":"180","article-title":"An algorithm for unification in equational theories","author":"Martelli","year":"1986"},{"key":"10.1016\/S0747-7171(89)80015-X_bib21","series-title":"Proc. of 1984 ACM Symposium on Lisp and Functional Programming","first-page":"184","article-title":"A proposal for standard ML","author":"Milner","year":"1984"},{"key":"10.1016\/S0747-7171(89)80015-X_bib22","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(89)80014-8","article-title":"Basic narrowing revisited","author":"Nutt","year":"1987"},{"key":"10.1016\/S0747-7171(89)80015-X_bib23","article-title":"Computing in systems described by equations","volume":"58","author":"O'Donnell","year":"1977"},{"key":"10.1016\/S0747-7171(89)80015-X_bib24","author":"O'Donnell","year":"1985"},{"key":"10.1016\/S0747-7171(89)80015-X_bib25","first-page":"73","article-title":"Building-in equational theories","volume":"7","author":"Plotkin","year":"1972"},{"key":"10.1016\/S0747-7171(89)80015-X_bib26","series-title":"Proc. International Symposium on Logic Programming","first-page":"138","article-title":"Narrowing as the operational semantics of functional languages","author":"Reddy","year":"1985"},{"key":"10.1016\/S0747-7171(89)80015-X_bib27","series-title":"Proc. Rewriting Techniques and Applications","first-page":"141","article-title":"NARROWER: a new algorithm and its application to logic programming","volume":"202","author":"R\u00e9ty","year":"1985"},{"key":"10.1016\/S0747-7171(89)80015-X_bib28","series-title":"Proc. RTA'87","first-page":"228","article-title":"Improving basic narrowing techniques","volume":"256","author":"R\u00e9ty","year":"1987"},{"key":"10.1016\/S0747-7171(89)80015-X_bib29","series-title":"Proc. 7th International Conference on Automated Deduction","first-page":"1","article-title":"Universal unification","author":"Siekmann","year":"1984"},{"issue":"4","key":"10.1016\/S0747-7171(89)80015-X_bib30","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","article-title":"Automated theorem proving for theories with simplifier, commutativity, and associativity","volume":"21","author":"Slagle","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(89)80015-X_bib31","series-title":"Logic Programming: Functions, Relations, and Equations","first-page":"1986","article-title":"FUNLOG: a computational model integrating logic and functional programming","author":"Subrahmanyam","year":"1986"},{"key":"10.1016\/S0747-7171(89)80015-X_bib32","series-title":"SASL language manual","first-page":"1979","author":"Turner","year":"1979"},{"key":"10.1016\/S0747-7171(89)80015-X_bib33","series-title":"Proc. RTA'85","article-title":"Combining unification algorithms for confined equational theories","volume":"202","author":"Yellick","year":"1985"},{"key":"10.1016\/S0747-7171(89)80015-X_bib34","series-title":"Proc. 13th POPL","first-page":"209","article-title":"Equational logic programming: an extension to equational programming","author":"You","year":"1986"},{"key":"10.1016\/S0747-7171(89)80015-X_bib35","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00248250","article-title":"A class of confluent term rewriting systems and unification","volume":"2","author":"You","year":"1986","journal-title":"J. Automated Reasoning"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718980015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718980015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T04:17:16Z","timestamp":1557634636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S074771718980015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":35,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["S074771718980015X"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(89)80015-x","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}