{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:51Z","timestamp":1753889811622,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Unification in Description Logics has been introduced as a means to detect\nredundancies in ontologies. We try to extend the known decidability results for\nunification in the Description Logic $\\mathcal{EL}$ to disunification since\nnegative constraints can be used to avoid unwanted unifiers. While decidability\nof the solvability of general $\\mathcal{EL}$-disunification problems remains an\nopen problem, we obtain NP-completeness results for two interesting special\ncases: dismatching problems, where one side of each negative constraint must be\nground, and local solvability of disunification problems, where we consider\nonly solutions that are constructed from terms occurring in the input problem.\nMore precisely, we first show that dismatching can be reduced to local\ndisunification, and then provide two complementary NP-algorithms for finding\nlocal solutions of disunification problems.<\/jats:p>","DOI":"10.2168\/lmcs-12(4:1)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:07:20Z","timestamp":1502359640000},"source":"Crossref","is-referenced-by-count":2,"title":["Extending Unification in $\\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification"],"prefix":"10.46298","volume":"Volume 12, Issue 4","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0924-8478","authenticated-orcid":false,"given":"Stefan","family":"Borgwardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4724-7206","authenticated-orcid":false,"given":"Barbara","family":"Morawska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1302:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2063\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2063\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:09:19Z","timestamp":1681243759000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(4:1)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1609.05621","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1609.05621","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2063"}}