{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:06Z","timestamp":1725551586245},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Unification in Description Logics (DLs) has been proposed as an inference<\/jats:p><jats:p>service that can, for example, be used to detect redundancies in ontologies.<\/jats:p><jats:p>For the DL EL, which is used to define several large<\/jats:p><jats:p>biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed<\/jats:p><jats:p>until recently could not deal with ontologies containing general concept inclusions (GCIs).<\/jats:p><jats:p>In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the<\/jats:p><jats:p>developed unification algorithms can deal with need to satisfy a certain cycle restriction.<\/jats:p><jats:p>In the present paper, we follow a different approach.  Instead of restricting the input ontologies,<\/jats:p><jats:p>we generalize the notion of unifiers to so-called hybrid unifiers. Whereas classical unifiers can be viewed as acyclic TBoxes,<\/jats:p><jats:p>hybrid unifiers are cyclic TBoxes, which are interpreted together with the ontology of the input using a hybrid semantics that<\/jats:p><jats:p>combines fixpoint and declarative semantics. We show that hybrid unification in EL is NP-complete<\/jats:p>","DOI":"10.29007\/h59c","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:59:07Z","timestamp":1516730347000},"page":"8-2","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Unification in the Description Logic EL"],"prefix":"10.29007","volume":"19","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Fernandez Gil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Morawska","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-23T17:59:08Z","timestamp":1516730348000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/cWv"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/h59c","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}