We introduce a general abstract framework for database repairs, where the repair notions are defined using formal logic. We distinguish between integrity constraints and so-called query constraints. The former are used to model consistency and desirable properties of the data (such as functional dependencies and independencies), while the latter relate two database instances according to their answers to the query constraints. The framework allows for a distinction between hard and soft queries, allowing the answers to a core set of queries to be preserved, as well as defining a distance between instances based on query answers. We illustrate how different notions of repairs from the literature can be modelled within our unifying framework. The framework generalises both set-based and cardinality based repairs to semiring annotated databases. Furthermore, we initiate a complexity-theoretic analysis of consistent query answering and checking existence of a repair within the framework.

翻译：我们提出了一种通用的抽象数据库修复框架，其中修复概念通过形式化逻辑进行定义。我们区分完整性约束与所谓的查询约束：前者用于建模数据的一致性及期望属性（如函数依赖与独立关系），后者则根据两个数据库实例对查询约束的响应结果来建立实例间关联。该框架支持硬查询与软查询的区分，既允许保留核心查询集的响应结果，也能基于查询响应定义实例间的距离度量。我们展示了文献中多种不同的修复概念如何在本统一框架内进行建模。该框架将基于集合与基于基数的修复方法同时推广至半环标注数据库。此外，我们针对该框架下的一致性查询应答及修复存在性判定问题展开了计算复杂性理论的初步分析。