Automata-Based Axiom Pinpointing

Franz BaaderFranz Baader, Rafael PeñalozaRafael Peñaloza

Download

Franz Baader, Rafael Peñaloza
Automata-Based Axiom Pinpointing
In Alessandro Armando and Peter Baumgartner and Gilles Dowek, eds., Proceedings of the 4th International Joint Conference on Automated Reasoning, (IJCAR 2008), volume 5195 of Lecture Notes in Artificial Intelligence, 226-241, 2008. Springer

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 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 bahaviour of a given weighted tree automaton.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ BaPe-IJCAR08,
  author = {Franz {Baader} and Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 4th International Joint Conference on Automated Reasoning, (IJCAR 2008)},
  editor = {Alessandro {Armando} and Peter {Baumgartner} and Gilles {Dowek}},
  pages = {226--241},
  publisher = {Springer},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Automata-Based Axiom Pinpointing},
  volume = {5195},
  year = {2008},
}