[Back]


Talks and Poster Presentations (with Proceedings-Entry):

T. Lukasiewicz, M. Martinez, A. Pieris, G. Simari:
"From Classical to Consistent Query Answering under Existential Rules";
Talk: 9th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015), Lima, Peru; 05-06-2015 - 05-08-2015; in: "Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015", CEUR Workshop Proceedings, 1378 (2015), 6 pages.



English abstract:
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 the current work 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


Electronic version of the publication:
http://ceur-ws.org/Vol-1378/AMW_2015_paper_9.pdf



Related Projects:
Project Head Stefan Woltran:
START


Created from the Publication Database of the Vienna University of Technology.