Abstract / Description of output
ABox Reasoning in large scale description logic (DL) knowledge bases, eg ontologies, is important for the success of many semantic-enriched systems. Performance of existing approaches, such as the tableau-based approach, and the disjunctive datalog approach, is restricted by their theoretical worst case complexity bound. In this paper, we propose a soundness-preserving approximate reasoning approach to address this issue. We first approximate an ontology in DL RO, a major fragment of OWL2-DL, to DL EL++, the underpin of OWL2-EL, plus an additional table maintaining the complementary relations between concept names. Then we can perform ABox reasoning either internally, or externally of the TBox with additional completion rules. The approximation and reasoning can be performed in PTIME. Our preliminary evaluation shows that our approach can outperform existing DL reasoners on real world and benchmark ontologies.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2010 International Workshop on Description Logics (DL2010) |
Editors | Volker Haarslev, David Toman, Grant Weddell |
Publisher | CEUR-WS.org |
Pages | 325-335 |
Number of pages | 11 |
Publication status | Published - 9 Jun 2010 |
Event | The 23rd International Workshop on Description Logics - Waterloo, Canada Duration: 4 May 2010 → 7 May 2010 Conference number: 23 http://dl.kr.org/dl2010/index.html |
Publication series
Name | CEUR Workshop Proceedings |
---|---|
Publisher | CEUR-WS.org |
Volume | 573 |
ISSN (Electronic) | 1613-0073 |
Workshop
Workshop | The 23rd International Workshop on Description Logics |
---|---|
Abbreviated title | DL 2010 |
Country/Territory | Canada |
City | Waterloo |
Period | 4/05/10 → 7/05/10 |
Internet address |