Answering Temporal Conjunctive Queries over DL Ontologies

Talk by Stefan Borgwardt

Location: APB 3105
Start: 18. May 2015 at 2:50 pm
End: 18. May 2015 at 3:50 pm
Research group: Computational Logic
Research group: Automata Theory
Research group: Knowledge-Based Systems
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.