Repairing Ontologies for Incomplete Reasoners.
The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the probl...
Main Authors: | , , , |
---|---|
Drugi avtorji: | |
Format: | Journal article |
Jezik: | English |
Izdano: |
Springer
2011
|
_version_ | 1826300623391293440 |
---|---|
author | Stoilos, G Grau, B Motik, B Horrocks, I |
author2 | Aroyo, L |
author_facet | Aroyo, L Stoilos, G Grau, B Motik, B Horrocks, I |
author_sort | Stoilos, G |
collection | OXFORD |
description | The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of 'repairing' an ontology T - that is, computing an ontology R such that a reasoner that is incomplete for T becomes complete when used with T ∪ R. We identify conditions on T and the reasoner that make this possible, present a practical algorithm for computing R, and present a preliminary evaluation which shows that, in some realistic cases, repairs are feasible to compute, reasonable in size, and do not significantly affect reasoner performance. © 2011 Springer-Verlag. |
first_indexed | 2024-03-07T05:19:59Z |
format | Journal article |
id | oxford-uuid:de8f071c-2a6e-44f1-90f0-38e6b1303be2 |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-07T05:19:59Z |
publishDate | 2011 |
publisher | Springer |
record_format | dspace |
spelling | oxford-uuid:de8f071c-2a6e-44f1-90f0-38e6b1303be22022-03-27T09:33:02ZRepairing Ontologies for Incomplete Reasoners.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:de8f071c-2a6e-44f1-90f0-38e6b1303be2EnglishSymplectic Elements at OxfordSpringer2011Stoilos, GGrau, BMotik, BHorrocks, IAroyo, LWelty, CAlani, HTaylor, JBernstein, AKagal, LNoy, NBlomqvist, EThe need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of 'repairing' an ontology T - that is, computing an ontology R such that a reasoner that is incomplete for T becomes complete when used with T ∪ R. We identify conditions on T and the reasoner that make this possible, present a practical algorithm for computing R, and present a preliminary evaluation which shows that, in some realistic cases, repairs are feasible to compute, reasonable in size, and do not significantly affect reasoner performance. © 2011 Springer-Verlag. |
spellingShingle | Stoilos, G Grau, B Motik, B Horrocks, I Repairing Ontologies for Incomplete Reasoners. |
title | Repairing Ontologies for Incomplete Reasoners. |
title_full | Repairing Ontologies for Incomplete Reasoners. |
title_fullStr | Repairing Ontologies for Incomplete Reasoners. |
title_full_unstemmed | Repairing Ontologies for Incomplete Reasoners. |
title_short | Repairing Ontologies for Incomplete Reasoners. |
title_sort | repairing ontologies for incomplete reasoners |
work_keys_str_mv | AT stoilosg repairingontologiesforincompletereasoners AT graub repairingontologiesforincompletereasoners AT motikb repairingontologiesforincompletereasoners AT horrocksi repairingontologiesforincompletereasoners |