{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:16:31Z","timestamp":1725524191241},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Automated reasoning modulo an equational theory E is a fundamental technique in many applications. In this talk, we would present a narrowing-based equational unification algorithm for theories satisfying the finite variant property. We also talk about equational generalization, also called anti-unification<\/jats:p>","DOI":"10.29007\/65sh","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:07Z","timestamp":1516748347000},"page":"1--1","source":"Crossref","is-referenced-by-count":0,"title":["Unification and Anti-unification modulo Equational Theories"],"prefix":"10.29007","volume":"19","author":[{"given":"Santiago","family":"Escobar","sequence":"first","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-23T23:00:10Z","timestamp":1516748410000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/gt9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/65sh","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}