Quasi-classical reasoning in paraconsistent databases

DOI10.1007/S10472-017-9536-ZzbMATH Open1466.68036OpenAlexW2575526452MaRDI QIDQ1653451FDOQ1653451

Authors: Badrinath Jayakumar, Rajshekhar Sunderraman 

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

Recommendations

• A paraconsistent relational data model
• Paraconsistent disjunctive deductive databases
• Computational Aspects of Quasi-Classical Entailment
• scientific article; zbMATH DE number 1844496
• COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES

zbMATH Keywords

fixpoint semanticsinconsistencyparaconsistent relational modelquasi-classical logic

Mathematics Subject Classification ID

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

Cites Work

• Paraconsistent logic programming
• Logical Weak Completions of Paraconsistent Logics
• Title not available (Why is that?)
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Title not available (Why is that?)
• Logics of formal inconsistency
• Logics with Common Weak Completions
• Uncertain rule-based fuzzy logic systems: introduction and new directions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-valued logic and Gröbner bases with applications to modal logic
• Title not available (Why is that?)
• Distance-based paraconsistent logics
• Paraconsistent declarative semantics for extended logic programs
• A backjumping technique for disjunctive logic programming
• Disjunctive databases for representing repairs
• Title not available (Why is that?)
• Paraconsistent disjunctive deductive databases
• An encompassing framework for paraconsistent logic programs
• Inconsistency-tolerant reasoning with OWL DL
• COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning with contradictory information using quasi-classical logic
• On deductive bases for paraconsistent answer set semantics
• Title not available (Why is that?)
• A paraconsistent relational data model

Cited In (9)

• A paraconsistent relational data model
• An algebraic construction of the well-founded model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paraconsistent disjunctive deductive databases
• Computational Aspects of Quasi-Classical Entailment
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Quasi-classical reasoning in paraconsistent databases

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