论文标题
在不一致的数据库中，paracensistent的逻辑和查询回答
Paraconsistent logic and query answering in inconsistent databases
论文作者
论文摘要
本文涉及paraconsistent逻辑LPQ $^{\ supset，\ Mathsf {f}} $以及它在关系数据库理论领域中的应用。从该逻辑的角度考虑了关系数据库的概念，适用于关系数据库的查询以及相对于可能不一致的关系数据库的查询的一致答案。此观点除其他外，还可以对查询的一致答案的定义，即可能不一致的数据库，而无需诉诸数据库维修。在上一篇论文中，LPQ $^{\ supset，\ Mathsf {f}} $由序列式的自然扣除系统呈现。在本文中，出现了序列的演算系统，因为使用顺序的演算系统作为证明搜索程序的基础是常见的，并且此类过程可能构成用于计算查询一致答案的算法的核心。
This paper concerns the paraconsistent logic LPQ$^{\supset,\mathsf{F}}$ and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without resort to database repairs. In a previous paper, LPQ$^{\supset,\mathsf{F}}$ is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented because it is common to use a sequent calculus proof system as the basis of proof search procedures and such procedures may form the core of algorithms for computing consistent answers to queries.
