LATPub733: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
Zeile 15: | Zeile 15: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic | |Abstract=Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic EL. While these problems are intractable, we propose methods for improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice. | ||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
Zeile 34: | Zeile 34: | ||
year = {2014}, | year = {2014}, | ||
} | } | ||
}} | }} |
Version vom 23. März 2015, 13:24 Uhr
Error-Tolerant Reasoning in the Description Logic EL
Michel LudwigMichel Ludwig, Rafael PeñalozaRafael Peñaloza
Michel Ludwig, Rafael Peñaloza
Error-Tolerant Reasoning in the Description Logic EL
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 14-11, 2014. LTCS-Report
Error-Tolerant Reasoning in the Description Logic EL
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 14-11, 2014. LTCS-Report
- KurzfassungAbstract
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic EL. While these problems are intractable, we propose methods for improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice. - Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ LuPe-LTCS-14-11,
address = {Dresden, Germany},
author = {Michel {Ludwig} and Rafael {Pe{\~n}aloza}},
institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
number = {14-11},
title = {Error-Tolerant Reasoning in the Description Logic EL},
type = {LTCS-Report},
year = {2014},
}