This work reviews how database theory uses tractable circuit classes from knowledge
compilation. We present relevant query evaluation tasks, and notions of tractable circuits …

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 …

Ranking is ubiquitous in everyday life. This paper is concerned with the problem of ranking
information of a knowledge base when this latter is possibly inconsistent. In particular, the …

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 …

Since 2005, significant progress has been made in the problem of Consistent Query
Answering (CQA) with respect to primary keys. In this problem, the input is a database …

In this paper we study Controlled Query Evaluation (CQE), a declarative approach to privacy-
preserving query answering over databases, knowledge bases, and ontologies. CQE is …

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

We discover a connection between finding subset-maximal repairs for sets of functional and
inclusion dependencies, and computing extensions within argumentation frameworks (AFs) …

Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data
management applications that include constraint mining, discovering unique column …