{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T23:51:17Z","timestamp":1672617077967},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0022-0000(91)90039-8","type":"journal-article","created":{"date-parts":[[2004,2,7]],"date-time":"2004-02-07T10:16:00Z","timestamp":1076148960000},"page":"54-75","source":"Crossref","is-referenced-by-count":4,"title":["Unification modulo an equality theory for equational logic programming"],"prefix":"10.1016","volume":"42","author":[{"given":"Jia-Hual","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(91)90039-8_BIB1","series-title":"Rewriting Techniques and Applications '87","article-title":"On equational theories, unification and decidability","volume":"Vol. 256","author":"Burckert","year":"1987"},{"key":"10.1016\/0022-0000(91)90039-8_BIB2","series-title":"Mathematical Studies of Information Processing","article-title":"Recursive programs as functions in a first order theory","volume":"Vol. 75","author":"Cartwright","year":"1979"},{"key":"10.1016\/0022-0000(91)90039-8_BIB3","series-title":"Logic Programming: Relations, Functions and Equations","year":"1986"},{"key":"10.1016\/0022-0000(91)90039-8_BIB4","series-title":"Proceedings, 1985 Symposium on Logic Programming","first-page":"54","article-title":"Logic programmining cum applicative programming","author":"Dershowitz","year":"1985"},{"key":"10.1016\/0022-0000(91)90039-8_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(85)80003-6","article-title":"Computing with rewrite rules","volume":"65","author":"Dershowitz","year":"1985","journal-title":"Inform. and Control"},{"issue":"No. 3","key":"10.1016\/0022-0000(91)90039-8_BIB6","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"},{"issue":"No. 4","key":"10.1016\/0022-0000(91)90039-8_BIB7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0743-1066(87)90006-9","article-title":"Logic programming with equality","volume":"4","author":"Van Emden","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(91)90039-8_BIB8","series-title":"CARP '83","first-page":"205","article-title":"Unification and matching in equational theories","volume":"Vol. 159","author":"Fages","year":"1983"},{"key":"10.1016\/0022-0000(91)90039-8_BIB9","series-title":"Proceedings, 4th Workshop on Automated Deduction","first-page":"161","article-title":"First-order unification in an equational theory","author":"Fay","year":"1979"},{"key":"10.1016\/0022-0000(91)90039-8_BIB10","series-title":"Proceedings, 1985 Symposium on Logic Programming","first-page":"172","article-title":"SLOG: A logic programming language interpreter based on clausal superposition and rewriting","author":"Fribourg","year":"1985"},{"key":"10.1016\/0022-0000(91)90039-8_BIB11","series-title":"Proceedings, 1986 Symposium on Logic Programming","first-page":"168","article-title":"SLD-resolution methods for Horn clauses with equality based on E-unification procedure","author":"Gallier","year":"1986"},{"key":"10.1016\/0022-0000(91)90039-8_BIB12","series-title":"Rewriting Techniques and Applications '87","first-page":"216","article-title":"A general complete E-unification procedure","volume":"Vol. 256","author":"Gallier","year":"1987"},{"key":"10.1016\/0022-0000(91)90039-8_BIB13","series-title":"Logic Programming: Relations, Functions and Equations","article-title":"Equality, types, modules and generics for logic programming","author":"Goguen","year":"1986"},{"key":"10.1016\/0022-0000(91)90039-8_BIB14","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\/0022-0000(91)90039-8_BIB15","series-title":"Call by need computations in nonambiguous linear term rewriting systems, 359","author":"Huet","year":"1979"},{"key":"10.1016\/0022-0000(91)90039-8_BIB16","first-page":"39","article-title":"Deduction and computation","volume":"Vol. 232","author":"Huet","year":"1986","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/0022-0000(91)90039-8_BIB17","series-title":"Proceedings, 5th Conference on Automated Deduction","first-page":"318","article-title":"Canonical forms and unification","author":"Hullot","year":"1980"},{"key":"10.1016\/0022-0000(91)90039-8_BIB18","series-title":"Proceedings, 14th Annual Symposium on Principles of Programming Languages","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0022-0000(91)90039-8_BIB19","series-title":"Proceedings, 1987 Symposium on Logic Programming","first-page":"318","article-title":"A complete semantic characterization of K-LEAF","author":"Levi","year":"1987"},{"key":"10.1016\/0022-0000(91)90039-8_BIB20","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"issue":"No. 2","key":"10.1016\/0022-0000(91)90039-8_BIB21","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0022-0000(91)90039-8_BIB22","series-title":"Proceedings, 1986 Symposium on Logic Programming","first-page":"180","article-title":"An algorithm for unification in equational theories","author":"Martelli","year":"1986"},{"key":"10.1016\/0022-0000(91)90039-8_BIB23","article-title":"Computing in systems described by equations","volume":"Vol. 58","author":"O'Donnell","year":"1977"},{"key":"10.1016\/0022-0000(91)90039-8_BIB24","series-title":"Equational Logic as a Programming Language","author":"O'Donnell","year":"1985"},{"key":"10.1016\/0022-0000(91)90039-8_BIB25","series-title":"Machine Intelligence","first-page":"73","article-title":"Building-in equational theories","author":"Plotkin","year":"1972"},{"key":"10.1016\/0022-0000(91)90039-8_BIB26","series-title":"Rewriting Techniques and Applications '85","first-page":"141","article-title":"NARROWER: A new algorithm and its application to logic programming","volume":"Vol. 202","author":"R\u00e9ty","year":"1985"},{"key":"10.1016\/0022-0000(91)90039-8_BIB27","series-title":"Rewriting Techniques and Applications '87","first-page":"228","article-title":"Improving basic narrowing techniques","volume":"Vol. 256","author":"R\u00e9ty","year":"1987"},{"key":"10.1016\/0022-0000(91)90039-8_BIB28","series-title":"Proceedings, 1985 Symposium on Logic Programming","first-page":"138","article-title":"Narrowing as the operational semantics of functional languages","author":"Reddy","year":"1985"},{"key":"10.1016\/0022-0000(91)90039-8_BIB29","series-title":"Proceedings, 7th Conference on Automated Deduction","first-page":"1","article-title":"Universal unification","author":"Siekmann","year":"1984"},{"key":"10.1016\/0022-0000(91)90039-8_BIB30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","article-title":"Automated deduction by theory resolution","volume":"1","author":"Stickel","year":"1985","journal-title":"J. Automated, Reasoning"},{"key":"10.1016\/0022-0000(91)90039-8_BIB31","series-title":"Proceedings, 13th Annual Symposium on Principles of Programming Languages","first-page":"209","article-title":"Equational logic programming: An extension to equational programming","author":"You","year":"1986"},{"key":"10.1016\/0022-0000(91)90039-8_BIB32","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"},{"key":"10.1016\/0022-0000(91)90039-8_BIB33","series-title":"15th Colloquium on Automata, Languages, and Programming","first-page":"727","article-title":"Outer narrowing for equational theories based on constructors","volume":"Vol. 317","author":"You","year":"1988"},{"key":"10.1016\/0022-0000(91)90039-8_BIB34","article-title":"Amalgamating Functional and Relational Programming through the Use of Equality Axioms","author":"Yukawa","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000091900398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000091900398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T05:20:45Z","timestamp":1550208045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000091900398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0022000091900398"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90039-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}