Querying inconsistent ontological knowledge bases is an important problem in practice, for which
several inconsistency-tolerant semantics have been proposed. In these semantics, the input database is
erroneous, and a repair is a maximally consistent database subset. Different notions of maximality (such
as subset and cardinality maximality) have been considered. In this paper, we give a precise picture of
the computational complexity of inconsistency-tolerant query answering in a wide range of Datalog+/–
languages under the cardinality-based versions of three prominent repair semantic
