Rafael Peñaloza Nyssen
Axiom-Pinpointing in Description Logics and Beyond
Dokumente und Dateien
- Volltext (PDF) - 0.97 MByte - MD5 SHA512
Hinweis
Bitte nutzen Sie beim Zitieren immer folgende Url:
http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-24743
Kurzfassung in Englisch
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.
weitere Metadaten
| Schlagwörter (Englisch) | Axiom-Pinpointing, Description Logics, automata, tableaux, ontology |
| Schlagwörter (Deutsch) | Axiom-Pinpointing, Beschreibungslogik, Automaten, Tableau, Ontologie |
| DDC Klassifikation | 004 |
| RVK Klassifikation | ST 125, ST 134 |
| Institution(en) | |
| Institution | Technische Universität Dresden |
| Abteilung | Fakultät Informatik |
| Betreuer | Prof. Dr.-Ing. Franz Baader |
| Gutachter | Prof. Dr.-Ing. Franz Baader Prof. Ulrike Sattler |
| Dokumententyp | Dissertation |
| Sprache | Englisch |
| Tag d. Einreichung (bei der Fakultät) | 08.04.2009 |
| Tag d. Verteidigung / Kolloquiums / Prüfung | 14.08.2009 |
| Veröffentlichungsdatum (online) | 08.10.2009 |
| persistente URN | urn:nbn:de:bsz:14-qucosa-24743 |