An Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
Haibin Wang, Hao Tian, Rajshekhar Sunderraman

TL;DR
This paper introduces an extended data model that explicitly represents and manipulates mixed disjunctive positive and negative information within disjunctive databases, enhancing data representation capabilities.
Contribution
It extends the generalized disjunctive paraconsistent data model to include explicit mixed disjunctive information and generalizes relational algebra for this new structure.
Findings
Correctness of the generalized relational algebra is established.
The extended model effectively handles mixed disjunctive positive and negative data.
Enhanced data representation for disjunctive databases is achieved.
Abstract
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay between these two types of information. Extended generalized disjunctive paraconsistent relation is introduced as the main structure in this model. The relational algebra is appropriately generalized to work on extended generalized disjunctive paraconsistent relations and their correctness is established.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Database Systems and Queries · Semantic Web and Ontologies
