Quelltext der Seite From Classical to Consistent Query Answering under Existential Rules

{{Veranstaltung
|Titel EN=From Classical to Consistent Query Answering under Existential Rules
|Beschreibung EN=Querying inconsistent ontologies is an intriguing new problem that gave rise to a flourishing research activity in the description logic (DL) community. The computational complexity of consistent query answering under the main DLs is rather well understood; however, little is known about existential rules. The goal of this talk is to perform an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints. Our investigation focuses on the standard inconsistency-tolerant semantics, namely, the AR semantics. We establish generic complexity results, which demonstrate the tight connection between classical and consistent query answering. These results allow us to obtain in a uniform way a relatively complete picture of the complexity of our problem.


This is join work with Thomas Lukasiewicz, Maria Vanina Martinez, and Gerardo I. Simari
|Veranstaltungsart=Vortrag
|Start=2015/06/15 14:50:00
|Ende=2015/06/15 15:50:00
|Raum=APB 3105
|Vortragender=Andreas Pieris
|Forschungsgruppe=Computational Logic
|Event series=KBS Seminar
|In News anzeigen=1
}}