{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:50Z","timestamp":1751983610467},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"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":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90189-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"169-187","source":"Crossref","is-referenced-by-count":11,"title":["Semi-unification"],"prefix":"10.1016","volume":"81","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Musser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Stillman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90189-9_BIB1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(86)90003-6","article-title":"About the Paterson-Wegman linear unification algorithm","volume":"32","author":"De Champeaux","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90189-9_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewritng systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/0304-3975(91)90189-9_BIB3","series-title":"Rewriting Techniques and Applications","first-page":"180","author":"Dershowitz","year":"1985"},{"key":"10.1016\/0304-3975(91)90189-9_BIB4","series-title":"Proc. ACM Conf. os LISP and Functional Programming","article-title":"Type inference and semi-unification","author":"Henglein","year":"1988"},{"key":"10.1016\/0304-3975(91)90189-9_BIB5","article-title":"Rewrite methods for clausal and non-clausal theorem proving","author":"Hsiang","year":"1983","journal-title":"Proc. 10th EATCS Internat. Coll. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(91)90189-9_BIB6","series-title":"Rapport Laboria 283","article-title":"On the uniform halting problem for term rewriting systems","author":"Huet","year":"1978"},{"key":"10.1016\/0304-3975(91)90189-9_BIB7","series-title":"Formal Languages: Perpectives and Open Problems","article-title":"Eqautions and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(91)90189-9_BIB8","article-title":"An equational approach to theorem proving in first-order predicate calculus","author":"Kapur","year":"1985","journal-title":"Proc. 9th Internat. Joint Conf. on Artificial Intelligence"},{"key":"10.1016\/0304-3975(91)90189-9_BIB9","article-title":"RRL: a rewrite rule laboratory","volume":"230","author":"Kapur","year":"1986"},{"key":"10.1016\/0304-3975(91)90189-9_BIB10","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0304-3975(91)90189-9_BIB11","first-page":"210","article-title":"Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjencture","volume":"95","author":"Kruskal","year":"1960","journal-title":"Trans. Amer. Math. Society"},{"key":"10.1016\/0304-3975(91)90189-9_BIB12","series-title":"Unpublished Draft","article-title":"A finite termination criterion","author":"Lankford","year":"1978"},{"key":"10.1016\/0304-3975(91)90189-9_BIB13","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\/0304-3975(91)90189-9_BIB14","first-page":"79","article-title":"A simple non-termination test for the Knuth-Bendix method","volume":"230","author":"Plaisted","year":"1986"},{"key":"10.1016\/0304-3975(91)90189-9_BIB15","first-page":"54","article-title":"Detecting looping simplifications","volume":"250","author":"Purdom","year":"1987"},{"key":"10.1016\/0304-3975(91)90189-9_BIB16","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:30Z","timestamp":1555113210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591901899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0304397591901899"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90189-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}