Journal
JOURNAL OF AUTOMATED REASONING
Volume 45, Issue 2, Pages 91-129Publisher
SPRINGER
DOI: 10.1007/s10817-010-9181-2
Keywords
Axiom-pinpointing; Automated reasoning; Weighted automata; Explanation; Description logics
Categories
Ask authors/readers for more resources
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question (MinA). Most of the pinpointing algorithms described in the DL literature are obtained as extensions of tableau-based reasoning algorithms for computing consequences from DL knowledge bases. In this paper, we show that automata-based algorithms for reasoning in DLs and other logics can also be extended to pinpointing algorithms. The idea is that the tree automaton constructed by the automata-based approach can be transformed into a weighted tree automaton whose so-called behaviour yields a pinpointing formula, i.e., a monotone Boolean formula whose minimal valuations correspond to the MinAs. We also develop an approach for computing the behaviour of a given weighted tree automaton. We use the DL SI well as Linear Temporal Logic (LTL) to illustrate our new pinpointing approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available