Solving unification in the description logic $\mathcal{FL}_\bot$
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908485843681280 |
|---|---|
| author | Morawska, Barbara Marzec, Dariusz |
| author_facet | Morawska, Barbara Marzec, Dariusz |
| contents | We present an algorithm for solving the unification problem in the description logic $\mathcal{FL}_\bot$. This logic extends $\mathcal{FL}_0$ with the bottom constructor, and thus supports conjunction, value restrictions, top and bottom constructors. Unification of concepts can be a useful tool for ontology maintenance; however, little is known about unification even in small, restricted description logics. The unification problem has been solved only for $\mathcal{FL}_0$ and $\mathcal{EL}$. This paper contributes to the ongoing effort to extend these results to richer logics. Our algorithm runs in exponential time with respect to the size of the problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_00912 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Solving unification in the description logic $\mathcal{FL}_\bot$ Morawska, Barbara Marzec, Dariusz Symbolic Computation Logic in Computer Science We present an algorithm for solving the unification problem in the description logic $\mathcal{FL}_\bot$. This logic extends $\mathcal{FL}_0$ with the bottom constructor, and thus supports conjunction, value restrictions, top and bottom constructors. Unification of concepts can be a useful tool for ontology maintenance; however, little is known about unification even in small, restricted description logics. The unification problem has been solved only for $\mathcal{FL}_0$ and $\mathcal{EL}$. This paper contributes to the ongoing effort to extend these results to richer logics. Our algorithm runs in exponential time with respect to the size of the problem. |
| title | Solving unification in the description logic $\mathcal{FL}_\bot$ |
| topic | Symbolic Computation Logic in Computer Science |
| url | https://arxiv.org/abs/2405.00912 |