Paraconsistent logic and query answering in inconsistent databases

DOI10.1080/11663081.2024.2312776arXiv2208.12976WikidataQ128492131 ScholiaQ128492131MaRDI QIDQ6117329

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

relational databasesequent calculusparaconsistent logicconsistent query answeringinconsistent database

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the data complexity of consistent query answering
• Querying logical databases
• The logic of paradox
• Subminimal negation
• The lattice of extensions of the minimal logic
• Truth in a Logic of Formal Inconsistency: How classical can it get?
• A paraconsistent relational data model
• A relational model of data for large shared data banks
• On the strongest three-valued paraconsistent logic contained in classical logic and its dual
• Proof theory

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