Tuple relational calculus for paraconsistent databases

DOI10.1007/3-540-44399-1_42MaRDI QIDQ4471892zbMATH OpenFDO

Authors Rajiv Bagai

Publication date 30 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1952/19520409.htm

zbMATH Keywords

Incomplete and inconsistent informationRelational data modelTuple relational calculus

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A paraconsistent relational data model
• Efficient representation and algebraic manipulation of infinite relations in paraconsistent databases
• Paraconsistency in object-oriented databases
• Applications of annotated predicate calculus to querying inconsistent databases
• Quasi-classical reasoning in paraconsistent databases

Cited in

(7)

• Quasi-classical reasoning in paraconsistent databases
• Efficient representation and algebraic manipulation of infinite relations in paraconsistent databases
• scientific article; zbMATH DE number 3883649 (Why is no real title available?)
• scientific article; zbMATH DE number 6887211 (Why is no real title available?)
• A paraconsistent relational data model
• scientific article; zbMATH DE number 975706 (Why is no real title available?)
• A Data Model Based on Paraconsistent Intuitionistic Fuzzy Relations

This page was built for publication: Tuple relational calculus for paraconsistent databases

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