Techreport3025: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Stefan Borgwardt (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Franz |ErsterAutorNachname=Baader |FurtherAuthors=Stefan Borgwardt; Marcel Lippmann; }} {{Techreport |Title=Tem…“) |
Marcel Lippmann (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 2: | Zeile 2: | ||
|ErsterAutorVorname=Franz | |ErsterAutorVorname=Franz | ||
|ErsterAutorNachname=Baader | |ErsterAutorNachname=Baader | ||
|FurtherAuthors=Stefan Borgwardt; Marcel Lippmann; | |FurtherAuthors=Stefan Borgwardt; Marcel Lippmann; | ||
}} | }} | ||
{{Techreport | {{Techreport | ||
|Title=Temporal Conjunctive Queries in Expressive | |Title=Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles | ||
|Year=2015 | |Year=2015 | ||
|Institution=Chair for Automata Theory, Technische Universität Dresden | |Institution=Chair for Automata Theory, Technische Universität Dresden | ||
| Zeile 13: | Zeile 13: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing of temporal information. We extend the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allow for queries containing transitive roles. | |Abstract=In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing of temporal information. We extend the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allow for queries containing transitive roles. | ||
|Download=BaBL-LTCS-15-17.pdf | |Download=BaBL-LTCS-15-17.pdf | ||
|Projekt=HAEC | |Projekt=HAEC | ||
|Forschungsgruppe=Automatentheorie | |Forschungsgruppe=Automatentheorie | ||
}} | }} | ||
Version vom 7. Dezember 2015, 09:03 Uhr
Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles
Franz BaaderFranz Baader, Stefan BorgwardtStefan Borgwardt, Marcel LippmannMarcel Lippmann
Franz Baader, Stefan Borgwardt, Marcel Lippmann
Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles
Technical Report, Chair for Automata Theory, Technische Universität Dresden, volume 15-17, 2015. LTCS-Report
Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles
Technical Report, Chair for Automata Theory, Technische Universität Dresden, volume 15-17, 2015. LTCS-Report
- KurzfassungAbstract
In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. In order to deal with dynamically changing data sources, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of OBDA to support the processing of temporal information. We extend the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allow for queries containing transitive roles. - Projekt:Project: HAEC
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{BBL2015,
author = {Franz Baader and Stefan Borgwardt and Marcel Lippmann},
title = {Temporal Conjunctive Queries in Expressive {DLs} with
Non-simple Roles},
institution = {Chair for Automata Theory, Technische Universit{\"{a}}t Dresden},
year = {2015}
}
