An Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
Haibin Wang, Hao Tian, Rajshekhar Sunderraman
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.
Create a lesson
Related papers
Navigating Runtime Dynamism in Semantic Query Serving
Hengrui Zhang, Xupeng Miao
SQLoom: Set-Contrastive Learning of Syntactic, Semantic, and Logical Dependencies for Text-to-SQL
Hao Fu, Degang Sun, Wan Wei et al.
Stop Handcrafting Your Engine! GenDB-V: Towards AI-Generated and Formally Verified Database Systems
Jiale Lao, Immanuel Trummer
Recast: Refinement-Centered Approximate Nearest Neighbor Search Optimized for Storage
Zehai Yang, Fengyi Tao, Wenzhuo Dong et al.
USDB: Scaling Storage for Next-Generation Recommender Systems at ByteDance
Xiaoran Zhu, Jieming Cai, Weiping Yu et al.
Mixed-Type Relational Database Synthesis with Graph-Prompted Language Model
Yuxiang Sun, Mengshi Chen, Jianwei Wang et al.