Abstract
This paper concerns the paraconsistent logic LPQ$^{\supset,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 an earlier paper, LPQ$^{\supset,F}$ is presented with a sequent-style
natural deduction proof system.
In this paper, a sequent calculus proof system is presented instead
because such proof systems are generally considered more suitable as the
basis of proof search procedures than natural deduction proof systems
and proof search procedures can serve as the core of algorithms for
computing consistent answers to queries.
Preprint available:
arXiv:2208.12976v5 [cs.DB]