Repairing Ontologies For Incomplete Reasoners
ISWC'11: Proceedings of the 10th international conference on The semantic web - Volume Part I(2011)
摘要
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 boolean OR 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 riot significantly affect reasoner performance.
更多查看译文
关键词
reasoner performance,incomplete OWL,ontology R,scalable query,Semantic Web application,practical algorithm,preliminary evaluation,realistic case,Repairing ontology,incomplete reasoner
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要