Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 550 - 559
1. Verfasser:	Fontaine, Gaelle
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2013
Schlagworte:	Complexity theory Computer science Data integration Educational institutions Maintenance engineering Polynomials
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!