Tractable extensions of the description logic EL with numerical datatypes
From MaRDI portal
Publication:438566
DOI10.1007/S10817-011-9235-0zbMATH Open1243.68275DBLPjournals/jar/MagkaKH11OpenAlexW1996497762WikidataQ56988650 ScholiaQ56988650MaRDI QIDQ438566FDOQ438566
Authors: Despoina Magka, Yevgeny Kazakov, Ian Horrocks
Publication date: 31 July 2012
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-011-9235-0
Recommendations
- Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
Cites Work
Cited In (6)
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
- Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
- Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
- Reasoning within fuzzy OWL 2 EL revisited
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
This page was built for publication: Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438566)