{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:26:43Z","timestamp":1669336003968},"reference-count":21,"publisher":"Elsevier BV","issue":"4","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,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"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":[[1992,10]]},"DOI":"10.1016\/0747-7171(92)90010-2","type":"journal-article","created":{"date-parts":[[2004,12,9]],"date-time":"2004-12-09T22:58:50Z","timestamp":1102633130000},"page":"303-320","source":"Crossref","is-referenced-by-count":6,"title":["An improved general E-unification method"],"prefix":"10.1016","volume":"14","author":[{"given":"Daniel J.","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Patricia","family":"Johann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0747-7171(92)90010-2_BIB1","article-title":"Proof Methods for Equational Theories","author":"Bachmair","year":"1987"},{"key":"10.1016\/0747-7171(92)90010-2_BIB2","series-title":"Proc. Symp. on Logic in Computer Science","first-page":"346","article-title":"Orderings for equational proofs","author":"Bachmair","year":"1986"},{"key":"10.1016\/0747-7171(92)90010-2_BIB3","series-title":"Proceedings of CREAS","article-title":"Completion without failure","author":"Bachmair","year":"1987"},{"key":"10.1016\/0747-7171(92)90010-2_BIB4","first-page":"243","article-title":"Term Rewriting Systems","author":"Dershowitz","year":"1991"},{"key":"10.1016\/0747-7171(92)90010-2_BIB5","series-title":"Proc. Tenth International Conference on Automated Deduction","first-page":"261","article-title":"An improved general E-unification method","volume":"449","author":"Dougherty","year":"1990"},{"key":"10.1016\/0747-7171(92)90010-2_BIB6","series-title":"Proc. Fourth Workshop on Automated Deduction","article-title":"First-order unification in an equational theory","author":"Fay","year":"1979"},{"key":"10.1016\/0747-7171(92)90010-2_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(86)90175-1","article-title":"Complete sets of unifiers and matchers in equational theories","volume":"43","author":"Fages","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0747-7171(92)90010-2_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","article-title":"Complete sets of transformations for general E-unification","volume":"67","author":"Gallier","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0747-7171(92)90010-2_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/947864.947865","article-title":"Completeness of many-sorted equational logic","author":"Goguen","year":"1981","journal-title":"ACM SIG-PLAN Notices"},{"key":"10.1016\/0747-7171(92)90010-2_BIB10","first-page":"307","article-title":"Completeness of many-sorted equational logic","author":"Goguen","year":"1985","journal-title":"Houston Journal of Mathematics"},{"key":"10.1016\/0747-7171(92)90010-2_BIB11","series-title":"Logical Writings","article-title":"Sur la Theorie de la Demonstration","author":"Herbrand","year":"1930-1971"},{"key":"10.1016\/0747-7171(92)90010-2_BIB12","series-title":"Proc. Fifth International Conference on Automated Deduction","first-page":"318","article-title":"Canonical forms and unification","volume":"87","author":"Hullot","year":"1980"},{"key":"10.1016\/0747-7171(92)90010-2_BIB13","series-title":"Proc. Seventh International Conference on Automated Deduction","article-title":"A new equational unification method: a generalization of Martelli-Montanari's algorithm","author":"Kirchner","year":"1984"},{"key":"10.1016\/0747-7171(92)90010-2_BIB14","article-title":"M\u00e9thodes et Outils de Conception Systematique d'Algorithmes d'Unification dans les Theories Equationnelles","author":"Kirchner","year":"1985"},{"key":"10.1016\/0747-7171(92)90010-2_BIB15","series-title":"Proc. Symp. on Logic in Computer Science","first-page":"206","article-title":"Computing unification algorithms","author":"Kirchner","year":"1986"},{"key":"10.1016\/0747-7171(92)90010-2_BIB16","article-title":"Canonical Inference","author":"Lankford","year":"1975"},{"key":"10.1016\/0747-7171(92)90010-2_BIB17","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 Transactions on Programming Languages and Systems"},{"key":"10.1016\/0747-7171(92)90010-2_BIB18","series-title":"Proc. Third Conference on Logic Programming","article-title":"An algorithm for unification in equational theories","author":"Martelli","year":"1986"},{"key":"10.1016\/0747-7171(92)90010-2_BIB19","first-page":"73","article-title":"Building in equational theories","volume":"7","author":"Plotkin","year":"1972"},{"key":"10.1016\/0747-7171(92)90010-2_BIB20","first-page":"135","article-title":"Paramodulation and theorem-proving in first order theories with equality","volume":"7","author":"Robinson","year":"1969"},{"key":"10.1016\/0747-7171(92)90010-2_BIB21","first-page":"23","article-title":"Automated theorem proving for theories with simpliferrs, commutativity, and associativity","volume":"12","author":"Slagle","year":"1974","journal-title":"Journal of the ACM"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0747717192900102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0747717192900102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:26:48Z","timestamp":1548980808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0747717192900102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0747717192900102"],"URL":"https:\/\/doi.org\/10.1016\/0747-7171(92)90010-2","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}