A paraconsistent relational data model

DOI10.1080/00207169508804361zbMath0845.68031OpenAlexW2036242078MaRDI QIDQ4847156

Rajiv Bagai, Rajshekhar Sunderraman

Publication date: 10 September 1995

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804361

zbMATH Keywords

deductive databasesdatabase management systemrelational data model

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (3)

Quasi-classical reasoning in paraconsistent databases ⋮ An algebraic construction of the well-founded model ⋮ Paraconsistent logic and query answering in inconsistent databases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial values in a tabular database model
• Paraconsistent disjunctive deductive databases
• A semantical analysis of the calculi \(C_n\)
• Paraconsistent logic programming
• A foundation of CODD's relational maybe-operations
• A kripke-kleene semantics for logic programs*
• Incomplete Information in Relational Databases
• The well-founded semantics for general logic programs
• A relational model of data for large shared data banks

This page was built for publication: A paraconsistent relational data model