activity
20012006
most citedComplexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing 2006Show all

1 paper · 1 filter

cs.DB2006

Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics

Andrei Lopatenko, Leopoldo Bertossi

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the datab…