Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0

Gasse, Francis; Sofronie-Stokkermans, Viorica

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0

MPS-Authors

/persons/resource/persons44479

Gasse, Francis
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45516

Sofronie-Stokkermans, Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gasse, F., & Sofronie-Stokkermans, V. (2011). Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0. In R. Rosati, S. Rudolph, & M. Zakharyaschev (Eds.), Proceedings of the 2011 International Workshop on Description Logics (DL-2011) (pp. 125-135). Aachen, Germany: CEUR Workshop Proceedings.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-14EE-1

Abstract

We study possibilities of combining (fragments) of the lightweight description logics ${\cal F}{\cal L}_0$ and ${\cal E}{\cal L}$, and identify classes of subsumption problems in a combination of ${\cal E}{\cal L}$ and Horn-${\cal F}{\cal L}_0$, which can be checked in PSPACE resp. PTIME. Since ${\cal F}{\cal L}_0$ allows universal role restrictions and ${\cal E}{\cal L}$ allows existential role restrictions, we thus have a framework where subsumption between expressions including both types of role restrictions (but for disjoint sets of roles) can be checked in polynomial space or time.