Paraconsistent logic and query answering in inconsistent databases

DOI10.1080/11663081.2024.2312776MaRDI QIDQ6117329zbMATH OpenWikidataFDO

Authors C. A. Middelburg

Publication date 20 March 2024

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.12976

zbMATH Keywords

consistent query answeringinconsistent databaseparaconsistent logicrelational databasesequent calculus

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Abstract: This paper concerns the paraconsistent logic LPQ${}^{supset,mathsfF}$ 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,mathsfF}$ 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.

Cites work

• A paraconsistent relational data model
• A relational model of data for large shared data banks
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 3993546 (Why is no real title available?)
• On the data complexity of consistent query answering
• On the strongest three-valued paraconsistent logic contained in classical logic and its dual
• Proof theory
• Querying logical databases
• Structural proof theory. With an appendix by Aarne Ranta
• Subminimal negation
• The lattice of extensions of the minimal logic
• The logic of paradox
• Truth in a logic of formal inconsistency: how classical can it get?

Cited in

(1)

• A note on the axiom of choice in an iterative paraconsistent set theory

This page was built for publication: Paraconsistent logic and query answering in inconsistent databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6117329)