This paper revisits the problem of repairing and querying inconsistent databases equipped with universal constraints. We adopt symmetric difference repairs, in which both deletions and additions of facts can be used to restore consistency, and suppose that preferred repair actions are specified via a binary priority relation over (negated) facts. Our first contribution is to show how existing notions of optimal repairs, defined for simpler denial constraints and repairs solely based on fact deletion, can be suitably extended to our richer setting. We next study the computational properties of the resulting repair notions, in particular, the data complexity of repair checking and inconsistency-tolerant query answering. Finally, we clarify the relationship between optimal repairs of prioritized databases and repair notions introduced in the framework of active integrity constraints. In particular, we show that Pareto-optimal repairs in our setting correspond to founded, grounded and justified repairs w.r.t. the active integrity constraints obtained by translating the prioritized database. Our study also yields useful insights into the behavior of active integrity constraints.

翻译：本文重新审视了在具有通用约束的不一致数据库中进行修复和查询的问题。我们采用对称差修复方法，其中既可以通过删除事实也可以通过添加事实来恢复一致性，并假设通过（否定）事实上的二元优先级关系来指定优先修复操作。我们的第一个贡献是展示了如何将现有为简单拒绝约束和仅基于事实删除的修复定义的最优修复概念，适当地扩展到我们更丰富的设置中。接着，我们研究了由此产生的修复概念的计算性质，特别是修复检查和不一致性容忍查询回答的数据复杂度。最后，我们阐明了优先级数据库中最优修复与在主动完整性约束框架中引入的修复概念之间的关系。具体而言，我们证明了我们设置中的帕累托最优修复对应于通过翻译优先级数据库获得的主动完整性约束下的有根据、有基础和有理由的修复。我们的研究还提供了对主动完整性约束行为的深刻见解。