Abstract

Abstract. Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities were not available for expressive DLs, whose reasoning is an un-natural refutation-based tableau. We offer a solution based on a sequent calculus that is closely related to the tableau implementation, exploiting its optimisations. The resulting proofs are pruned and then presented as simply as possible using templates. 1

Citations