Lexicographical Inference over Inconsistent DL-Based Ontologies

  • Authors:

  • Jianfeng Du;Guilin Qi;Yi-Dong Shen

  • Affiliations:

  • State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, and Graduate University of the Chinese Academy of Sciences, Beijing, China 100080;AIFB, Universität Karlsruhe, Karlsruhe, Germany D-76128;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences,

  • Venue:
  • RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Logical inconsistency may often occur throughout the development stage of a DL-based ontology. We apply the lexicographic inference to reason over inconsistent DL-based ontologies without repairing them first. We address the problem of checking consequences in a $\mathcal{SHIQ}$ ontology that are classically inferred from every consistent (or coherent) subontology having the highest lexicographic precedence . We propose a method for compiling a $\mathcal{SHIQ}$ ontology to a propositional program so that the problem can be solved in polynomial calls to a SAT solver. We prove that this time complexity is worst-case optimal in data complexity. In order to make the method more scalable, we also present partition-based techniques to optimize the calling of SAT solvers.