{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:00:48Z","timestamp":1768262448385,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:00:00Z","timestamp":1164758400000},"content-version":"vor","delay-in-days":5995,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0890-5401(90)90061-l","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"129-195","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"title":["Rigid E-unification: NP-completeness and applications to equational matings"],"prefix":"10.1016","volume":"87","author":[{"given":"Jean","family":"Gallier","sequence":"first","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]},{"given":"David","family":"Plaisted","sequence":"additional","affiliation":[]},{"given":"Wayne","family":"Snyder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0890-5401(90)90061-L_BIB1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/322248.322249","article-title":"Theorem proving via general matings","volume":"28","author":"Andrews","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90061-L_BIB2","series-title":"An Introduction to Mathematical Logic and Type Theory: To Truth through Proof","author":"Andrews","year":"1986"},{"key":"10.1016\/0890-5401(90)90061-L_BIB3","series-title":"Canonical Equational Proofs, Research Notes in Theoretical Computer Science","author":"Bachmair","year":"1989"},{"key":"10.1016\/0890-5401(90)90061-L_BIB4","series-title":"Proceedings, CREAS","article-title":"Completion without failure","author":"Bachmair","year":"1987"},{"key":"10.1016\/0890-5401(90)90061-L_BIB5","series-title":"Proceedings, LICS'86","first-page":"346","article-title":"Orderings for equational proofs","author":"Bachmair","year":"1986"},{"key":"10.1016\/0890-5401(90)90061-L_BIB6","series-title":"Principles of Combinatorics","author":"Berge","year":"1971"},{"key":"10.1016\/0890-5401(90)90061-L_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90061-L_BIB8","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the common subexpressions problem","volume":"27","author":"Downey","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90061-L_BIB9","series-title":"Logic for Computer Science: Foundations of Automatic Theorem Proving","author":"Gallier","year":"1986"},{"key":"10.1016\/0890-5401(90)90061-L_BIB10","series-title":"Proceedings, LICS'87","first-page":"338","article-title":"Theorem proving using rigid E-unification: Equational matings","author":"Gallier","year":"1987"},{"key":"10.1016\/0890-5401(90)90061-L_BIB11","series-title":"Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time","author":"Gallier","year":"1987"},{"key":"10.1016\/0890-5401(90)90061-L_BIB12","series-title":"Proceedings, LICS'88","first-page":"218","article-title":"Rigid E-unification is NP-complete","author":"Gallier","year":"1988"},{"key":"10.1016\/0890-5401(90)90061-L_BIB13","series-title":"Theorem proving using equational matings and rigid E-unification","author":"Gallier","year":"1988"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90061-L_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90061-L_BIB15","series-title":"Logical Writings","article-title":"Sur la th\u00e9orie de la d\u00e9monstration","author":"Herbrand","year":"1971"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90061-L_BIB16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90061-L_BIB17","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1982"},{"key":"10.1016\/0890-5401(90)90061-L_BIB18","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple word problems in univeral algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0890-5401(90)90061-L_BIB19","article-title":"Complexity of Finitely Presented Algebras","author":"Kozen","year":"1976"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90061-L_BIB20","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1147\/rd.254.0327","article-title":"Positive first-order logic is NP-complete","volume":"25","author":"Kozen","year":"1981","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0890-5401(90)90061-L_BIB21","series-title":"Basic Set Theory","author":"Levy","year":"1979"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90061-L_BIB22","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 Languages Systems"},{"key":"10.1016\/0890-5401(90)90061-L_BIB23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(83)90009-1","article-title":"About the rewriting systems produced by the Knuth-Bendix completion algorithm","volume":"16","author":"Metivier","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90061-L_BIB24","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","article-title":"Fast decision procedures based on congruence closure","volume":"27","author":"Nelson","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90061-L_BIB25","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90061-L_BIB26","first-page":"73","article-title":"Building in equational theories","volume":"7","author":"Plotkin","year":"1972","journal-title":"Machine Intelligence"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090061L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090061L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:10:05Z","timestamp":1757517005000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090061L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["089054019090061L"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90061-l","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rigid E-unification: NP-completeness and applications to equational matings","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(90)90061-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}