{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T20:33:56Z","timestamp":1725395636257},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>A critical question in unification theory is how to obtain<\/jats:p><jats:p>a unification algorithm for the combination of non-disjoint<\/jats:p><jats:p>equational theories when there exists unification algorithms<\/jats:p><jats:p>for the constituent theories. The problem is known to be<\/jats:p><jats:p>difficult and can easily be seen to be undecidable in the<\/jats:p><jats:p>general case. Therefore, previous work has focused on<\/jats:p><jats:p>identifying specific conditions and methods in which the<\/jats:p><jats:p>problem is decidable.<\/jats:p><jats:p>We continue the investigation in this paper, building on<\/jats:p><jats:p>previous combination results and our own work.<\/jats:p><jats:p>We are able to develop a novel approach to the non-disjoint<\/jats:p><jats:p>combination problem. The approach is based on a new set of<\/jats:p><jats:p>restrictions and combination method such that if the restrictions<\/jats:p><jats:p>are satisfied the method produces an algorithm for the unification<\/jats:p><jats:p>problem in the union of non-disjoint equational theories.<\/jats:p>","DOI":"10.29007\/vb87","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:07Z","timestamp":1516748347000},"page":"30-24","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Combination of Unication Algorithms (Extended Abstract)"],"prefix":"10.29007","volume":"19","author":[{"given":"Serdar","family":"Erbatur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M","family":"Marshall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Ringeissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"UNIF 2013. 27th International Workshop on Unification"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:07Z","timestamp":1516748347000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/wB"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/vb87","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}