Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

AMW
2010

favoriteEmaildiscussreport

137views Knowledge Management» more AMW 2010»

On the Decidability of Consistent Query Answering

13 years 6 months ago

On the Decidability of Consistent Query Answering

Download sunsite.informatik.rwth-aachen.de

Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certain integrity constraints. In this paper, we revisit the decidability status of consistent query answering by considering different parameters of the problem as input to the decision problem. More specifically, we obtain some new results about the undecidability and combined complexity of CQA.

Marcelo Arenas, Leopoldo E. Bertossi

Real-time Traffic

AMW 2010 | Certain Integrity Constraints | Consistent Query Answering | Decidability Status | Knowledge Management |

claim paper

Related Content

» The consistency extractor system Answer set programs for consistent query answering in dat...

» On the decidability and complexity of query answering over inconsistent and incomplete dat...

» The complexity and approximation of fixing numerical attributes in databases under integri...

» Approximate schemas sourceconsistency and query answering

» Answering XML queries using materialized views revisited

» Answer Sets for Consistent Query Answering in Inconsistent Databases

» Consistent query answering in databases

» Consistent query answering under primary keys a characterization of tractable queries

» Hippo A System for Computing Consistent Answers to a Class of SQL Queries

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	AMW
Authors	Marcelo Arenas, Leopoldo E. Bertossi

Comments (0)