  We study consistent query answering in relational databases. We consider an
expressive class of schema constraints that generalizes both tuple-generating
dependencies and equality-generating dependencies. We establish the complexity
of consistent query answering and repair checking under tuple-deletion
semantics for different fragments of the above constraint language. In
particular, we identify new subclasses of constraints in which the above
problems are tractable or even first-order rewritable.
