Quasi-classical reasoning in paraconsistent databases

DOI10.1007/s10472-017-9536-zzbMath1466.68036OpenAlexW2575526452MaRDI QIDQ1653451

Rajshekhar Sunderraman, Badrinath Jayakumar

Publication date: 6 August 2018

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-017-9536-z

zbMATH Keywords

inconsistencyfixpoint semanticsparaconsistent relational modelquasi-classical logic

Mathematics Subject Classification ID

Database theory (68P15) Paraconsistent logics (03B53)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-valued logic and Gröbner bases with applications to modal logic
• Disjunctive databases for representing repairs
• Paraconsistent disjunctive deductive databases
• Paraconsistent logic programming
• Paraconsistent declarative semantics for extended logic programs
• An encompassing framework for paraconsistent logic programs
• Distance-based paraconsistent logics
• Inconsistency-tolerant reasoning with OWL DL
• COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
• Logics with Common Weak Completions
• Logical Weak Completions of Paraconsistent Logics
• Reasoning with contradictory information using quasi-classical logic
• On deductive bases for paraconsistent answer set semantics
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• A paraconsistent relational data model
• Logics of Formal Inconsistency