Answering expressive queries over light-weight ontologies
Egor Kostylev (University of Edinburgh)
Info
|
Date |
25th June 2013 (week , Trinity Term 2013) |
|
Time |
11:30 |
|
Place |
165 - LTB |
Abstract
One of the main applications of description logics is the ontology-based data access model, which requires algorithms for
query answering over
ontologies. In fact, some description logics, like those in the DL-Lite family, are designed so
that simple queries, such as conjunctive queries, are efficiently computable.
In this talk I discuss what happens when one goes beyond and tries to answer more expressive queries, such as ones involving
negation (including inequalities), different types of aggregation and some others. I give a survey of previously known results,
subsume my recent work, and
conclude with the problems remain open.
Further info
|
Related series |
|
