Inconsistency-tolerant semantics for ontology-based data access
VCLA and WPI will host a talk by Meghyn Bienvenu on October 21st, 2013.
|DATE:||Monday, October 21, 2013|
|VENUE:||Seminar room Goedel (Favoritenstrasse 9-11, ground floor, access through courtyard)|
Recent years have seen an increasing interest in ontology-based data access (OBDA), in which the semantic knowledge provided by an ontology is exploited when querying data. One important challenge in applying OBDA in real-world applications is that it is likely that the data will contain some erroneous assertions, which may lead to the data being inconsistent with the ontology. Standard OBDA querying algorithms are next to useless in such circumstances, since first-order logic semantics (upon which almost all ontology languages are based) dictates that everything can be derived from a contradiction. To address this problem, several inconsistency-tolerant semantics have been proposed with the aim of providing meaningful answers to user queries in the presence of inconsistent data. In this talk, I will give an overview of this line of research, presenting the different semantics and their computational properties.