{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:45:03Z","timestamp":1762458303455},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":7259,"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":[[1993,9]]},"DOI":"10.1016\/0304-3975(93)90108-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"167-191","source":"Crossref","is-referenced-by-count":18,"title":["Complete axiomatizations of some quotient term algebras"],"prefix":"10.1016","volume":"118","author":[{"given":"Hubert","family":"Comon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90108-6_BIB1","series-title":"Proc. 9th Conf. on Automated deduction, Arguonne","article-title":"Solving disequations in equational theories","volume":"Vol. 310","author":"B\u00fcrckert","year":"1988"},{"key":"10.1016\/0304-3975(93)90108-6_BIB2","series-title":"Proc. Rewriting Techniques and Applications 87, Bordeaux","first-page":"204","article-title":"On equational theories, unification and decidability","volume":"Vol. 256","author":"B\u00fcrckert","year":"1987"},{"key":"10.1016\/0304-3975(93)90108-6_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1990.113734","article-title":"Solving inequations in term algebras","author":"Comon","year":"1990","journal-title":"Proc. 5th IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90108-6_BIB4","series-title":"Proc. ICALP","article-title":"Equational formulas in order-sorted algebras","author":"Comon","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB5","series-title":"Proc. ICALP","article-title":"Complete axiomatizations of some quotient term algebras","volume":"Vol. 510","author":"Comon","year":"1991"},{"key":"10.1016\/0304-3975(93)90108-6_BIB6","series-title":"Computational Logic: Essays in Honor of Alan Robinson","article-title":"Disunification: a survey","author":"Comon","year":"1991"},{"key":"10.1016\/0304-3975(93)90108-6_BIB7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","article-title":"Equational problems and disunification","volume":"7","author":"Comon","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(93)90108-6_BIB8","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"issue":"8","key":"10.1016\/0304-3975(93)90108-6_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(93)90108-6_BIB10","series-title":"Research Report IT 182","article-title":"The theory of ground rewrite systems is decidable","author":"Dauchet","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB11","series-title":"Proc. 15th Mathematical Foundations of Computer Science 90","article-title":"Syntactic theories","volume":"Vol. 452","author":"Jouannaud","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB12","series-title":"Computational Logic: Essays in Honor of Alan Robinson","article-title":"Solving equations in abstract algebras: a rule-based survey of unification","author":"Jouannaud","year":"1991"},{"key":"10.1016\/0304-3975(93)90108-6_BIB13","series-title":"Th\u00e8se d'Etat","article-title":"M\u00e9thodes et Outils de Conception Syst\u00e9matique d'Algorithmes d'Unification dans les Th\u00e9ories equationnelles","author":"Kirchner","year":"1985"},{"key":"10.1016\/0304-3975(93)90108-6_BIB14","series-title":"Proc. 5th IEEE Symp. on Logic in Computer Science","article-title":"Syntactic theories and unification","author":"Kirchner","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB15","series-title":"Proc. Workshop on Found. of Logic and Functional Programming, Trento","article-title":"Unification revisited","volume":"Vol. 306","author":"Lassez","year":"1986"},{"key":"10.1016\/0304-3975(93)90108-6_BIB16","series-title":"Proc. 3rd IEEE Symp. on Logic in Computer Science","first-page":"348","article-title":"Complete axiomatizations of the algebras of finite, rational and infinite trees","author":"Maher","year":"1988"},{"key":"10.1016\/0304-3975(93)90108-6_BIB17","series-title":"The Matamathematics of Algebraic Systems. Collected Papers. 1936\u20131967","first-page":"262","article-title":"Axiomatizable classes of locally free algebras of various types","author":"Mal'cev","year":"1971"},{"key":"10.1016\/0304-3975(93)90108-6_BIB18","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. ACM"},{"key":"10.1016\/0304-3975(93)90108-6_BIB19","series-title":"Tech. Report 210","article-title":"Higher-order unification, polymorphism and subsorts","author":"Nipkow","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB20","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0304-3975(93)90108-6_BIB21","series-title":"Tech. Report A-09\/90","article-title":"A new method for undecidability proofs of first-order theories","author":"Treinen","year":"1990"},{"key":"10.1016\/0304-3975(93)90108-6_BIB22","doi-asserted-by":"crossref","unstructured":"S. Tulipani, Decidability of the existential theory of infinite terms with subterm relation, Inform. and Comput. to appear.","DOI":"10.1006\/inco.1994.1001"},{"key":"10.1016\/0304-3975(93)90108-6_BIB23","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/23005.24037","article-title":"Decidability of the purely existential fragment of the theory of term algebras","volume":"34","author":"Venkataraman","year":"1987","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:41:10Z","timestamp":1621032070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593901086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0304397593901086"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90108-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}