LATPub731: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 9: | Zeile 9: | ||
|Month= | |Month= | ||
|Institution=Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden | |Institution=Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden | ||
|Note=See | |Note=See http://lat.inf.tu-dresden.de/research/reports.html. | ||
|Type=LTCS-Report | |Type=LTCS-Report | ||
|Reviewed=0 | |Reviewed=0 | ||
| Zeile 16: | Zeile 16: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Rough Description Logics have recently been studied as a means for representing and reasoning with imprecise knowledge. Real-world applications need to exploit reasoning over such knowledge in an efficient way. We describe how the combined approach to query answering can be extended to the rough setting. In particular, we extend both the canonical model and the rewriting procedure such that rough queries over rough EL ontologies can be answered by considering this information alone. | |Abstract=Rough Description Logics have recently been studied as a means for representing and reasoning with imprecise knowledge. Real-world applications need to exploit reasoning over such knowledge in an efficient way. We describe how the combined approach to query answering can be extended to the rough setting. In particular, we extend both the canonical model and the rewriting procedure such that rough queries over rough EL ontologies can be answered by considering this information alone. | ||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 35: | Zeile 34: | ||
year = {2014}, | year = {2014}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Conjunctive Query Answering in Rough EL
Rafael PeñalozaRafael Peñaloza, Veronika ThostVeronika Thost, Anni-Yasmin TurhanAnni-Yasmin Turhan
Rafael Peñaloza, Veronika Thost, Anni-Yasmin Turhan
Conjunctive Query Answering in Rough EL
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 14-04, 2014. LTCS-Report
Conjunctive Query Answering in Rough EL
Technical Report, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, volume 14-04, 2014. LTCS-Report
- KurzfassungAbstract
Rough Description Logics have recently been studied as a means for representing and reasoning with imprecise knowledge. Real-world applications need to exploit reasoning over such knowledge in an efficient way. We describe how the combined approach to query answering can be extended to the rough setting. In particular, we extend both the canonical model and the rewriting procedure such that rough queries over rough EL ontologies can be answered by considering this information alone. - Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ PeTT-LTCS-14-04,
address = {Dresden, Germany},
author = {Rafael {Pe{\~n}aloza} and Veronika {Thost} and Anni-Yasmin {Turhan}},
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-04},
title = {Conjunctive Query Answering in Rough EL},
type = {LTCS-Report},
year = {2014},
}
