- Authors
- Rafael Peñaloza Nyssen
- title
- Axiom-Pinpointing in Description Logics and Beyond
- Please use the following URL when quoting:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa-24743
- Date of submission
- 08.04.2009
- Date of defense
- 14.08.2009
- Abstract (EN)
- Building and mantaining large-scale ontologies is an error-prone task. It is thus not uncommon to find unwanted or unexpected consequences that follow implicitely from the restrictions in the ontology. To understand and correct these consequences, it is helpful to find the specific portions of the ontology that are responsible for them. Axiom-pinpointing is the task of finding minimal subontologies that entail a given consequence, also called MinAs. In this work we look at the task of computing all the MinAs by means of modified decision procedures. We first show that tableaux- and automata-based decision procedures can be transformed into pinpointing algorithms that output a (compact) representation of the set of all MinAs. We then explore the complexity of the problem.
- Keywords (DE)
- Axiom-Pinpointing, Beschreibungslogik, Automaten, Tableau, Ontologie
- Keywords (EN)
- Axiom-Pinpointing, Description Logics, automata, tableaux, ontology
- Classification (DDC)
- 004
- Classification (RVK)
- ST 125, ST 134
- Examiner
- Prof. Dr.-Ing. Franz Baader
- Prof. Ulrike Sattler
- Supervisor
- Prof. Dr.-Ing. Franz Baader
- Publishing house
- Technische Universität Dresden, Dresden
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa-24743
- Qucosa date of publication
- 08.10.2009
- Document type
- doctoral_thesis
- Document language
- English
- licence