We study the data complexity of consistent query answering (CQA) on databases that may
violate the primary key constraints. A repair is a maximal subset of the database satisfying …

We consider the problem of answering conjunctive queries with aggregation on database
instances that may violate primary key constraints. In SQL, these queries follow the SELECT …

The problem of consistent query answering for primary keys and self-join-free conjunctive
queries has been intensively studied in recent years and is by now well understood. In this …

We study consistent query answering via different graph representations. First, we introduce
solution-conflict hypergraphs in which nodes represent facts and edges represent either …

Operational consistent query answering (CQA) is a recent framework for CQA based on
revised definitions of repairs, which are built by applying a sequence of operations (eg, fact …

In this paper, we study consistent query answering in tables with nulls and functional
dependencies. Given such a table T, we consider the set Tuples of all tuples that can be built …

Most data analytical pipelines often encounter the problem of querying inconsistent data that
could violate pre-determined integrity constraints. Data cleaning is an extensively studied …