Repairing Incomplete Reasoners

Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems without sacrificing their favourable performance would be beneficial to many applications. In this paper, we address the following problem: given a query q, a TBox T and an incomplete reasoner ans (i.e., one that accepts q and T as valid inputs but fails to return all query answers to q w.r.t. T and some dataset), we aim at computing a (hopefully small) TBox R (a repair) which logically follows from T and such that ans is provably complete w.r.t. q and T ∪R, regardless of the input data. We identify conditions on q, T and ans that are sufficient to ensure the existence of such repair and present a practical repair generation algorithm. Our experiments suggest that repairs of small size can be computed for well-known ontologies and reasoners.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Giorgos Stoilos, Bernardo Cuenca Grau
• Keywords: Automated Reasoning, DLOG 2011, Generation Algorithm, Reasoner, Sacri