Answering Temporal Conjunctive Queries over DL Ontologies
Aus International Center for Computational Logic
Answering Temporal Conjunctive Queries over DL Ontologies
Vortrag von Stefan Borgwardt
- Veranstaltungsort: APB 3105
- Beginn: 18. Mai 2015 um 14:50
- Ende: 18. Mai 2015 um 15:50
- Forschungsgruppe: Automatentheorie
- Forschungsgruppe: Computational Logic
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: KBS Seminar
- iCal
Temporal Conjunctive Queries (TCQs) have been proposed as a formalism to access data that is collected by sensors at regular intervals. They allow to combine conjunctive queries using the operators of propositional linear-temporal logic (LTL). Recently, the complexity of TCQ entailment has been established in the presence of additional background knowledge formalized by an EL or SHQ ontology. This talk presents the main techniques used to obtain the complexity upper bounds and discusses ongoing work on TCQs over other DLs.
