Automata-based Axiom Pinpointing

Franz BaaderFranz Baader, Rafael PeñalozaRafael Peñaloza

Download

Franz Baader, Rafael Peñaloza
Automata-based Axiom Pinpointing
Journal of Automated Reasoning, 45(2):91-129, August 2010

Details
Bibtex

KurzfassungAbstract
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 as well as Linear Temporal Logic (LTL) to illustrate our new pinpointing approach.
Bemerkung: Note: Special Issue: Selected Papers from IJCAR 2008
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@article{ BaPe-JAR09,
  author = {Franz {Baader} and Rafael {Pe{\~n}aloza}},
  journal = {Journal of Automated Reasoning},
  month = {August},
  note = {Special Issue: Selected Papers from IJCAR~2008},
  number = {2},
  pages = {91--129},
  title = {Automata-based Axiom Pinpointing},
  volume = {45},
  year = {2010},
}