Logo image
Automata-based Pinpointing for DLs
Conference proceeding   Open access  Peer reviewed

Automata-based Pinpointing for DLs

Proceedings of the 2008 International Workshop on Description Logics (DL'08), Vol.353
CEUR Workshop Proceedings, 353
21st International Workshop on Description Logics (DL 2008) (Dresden, 13/05/2008 - 16/05/2008)
2008
Handle:
https://hdl.handle.net/10863/34757

Abstract

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.
url
http://ceur-ws.org/Vol-353/Penaloza.pdfView

Details

Metrics

1 Record Views