A Generalized Disjunctive Paraconsistent Data Model for Negative and Disjunctive Information

TL;DR

This paper introduces a generalized disjunctive paraconsistent data model that explicitly represents and manipulates both positive and negative disjunctive information, addressing limitations of traditional negation inference.

Contribution

It extends the disjunctive paraconsistent relational model to explicitly handle disjunctive negation and positive information, with a generalized relational algebra and correctness proofs.

Findings

Successfully models explicit disjunctive negative information.

Generalized relational algebra maintains correctness.

Enhances reasoning with negation in disjunctive databases.

Abstract

This paper presents a generalization of the disjunctive paraconsistent relational data model in which disjunctive positive and negative information can be represented explicitly and manipulated. There are situations where the closed world assumption to infer negative facts is not valid or undesirable and there is a need to represent and reason with negation explicitly. We consider explicit disjunctive negation in the context of disjunctive databases as there is an interesting interplay between these two types of information. Generalized disjunctive paraconsistent relation is introduced as the main structure in this model. The relational algebra is appropriately generalized to work on generalized disjunctive paraconsistent relations and their correctness is established.