Axiom Pinpointing in General Tableaux

From International Center for Computational Logic

Toggle side column

Axiom Pinpointing in General Tableaux

Franz BaaderFranz Baader,  Rafael PeñalozaRafael Peñaloza
Franz Baader, Rafael Peñaloza
Axiom Pinpointing in General Tableaux
Journal of Logic and Computation, 20(1):5-34, 2010
  • KurzfassungAbstract
    Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. Most of the pinpointing algorithms described in the DLliterature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this article is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of tableau algorithms, which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.
  • Bemerkung: Note: Special Issue: Tableaux and Analytic Proof Methods
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BaaPen-JLC10,
  author = {Franz {Baader} and Rafael {Pe{\~n}aloza}},
  journal = {Journal of Logic and Computation},
  note = {Special Issue: Tableaux and Analytic Proof Methods},
  number = {1},
  pages = {5--34},
  title = {Axiom Pinpointing in General Tableaux},
  volume = {20},
  year = {2010},
}