Automata-based Pinpointing for DLs
From International Center for Computational Logic
Automata-based Pinpointing for DLs
Rafael PeñalozaRafael Peñaloza
Rafael Peñaloza
Automata-based Pinpointing for DLs
Proceedings of the 2008 International Workshop on Description Logics (DL2008), volume 353 of CEUR-WS, 2008
Automata-based Pinpointing for DLs
Proceedings of the 2008 International Workshop on Description Logics (DL2008), volume 353 of CEUR-WS, 2008
- KurzfassungAbstract
The task of pinpointing the relevant subsets of axioms for a given property has acquired relevancy in the last years. In this paper we show how automata-based decision procedures can be adapted to produce a so-called pinpointing formula. The relevance of this method is method is shown by giving an (optimal) algorithm that computes pinpointing formulas for unsatisfiability of SI concepts w.r.t. general TBoxes. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Pen-DL08,
author = {Rafael {Pe{\~n}aloza}},
booktitle = {Proceedings of the 2008 International Workshop on Description Logics ({DL2008})},
series = {CEUR-WS},
title = {Automata-based Pinpointing for DLs},
volume = {353},
year = {2008},
}