Construction of P-Minimal Models Using Paraconsistent Relational Model

Positive extended disjunctive deductive databases are those that contain explicit negation both in the head and body of the clauses. For such databases, paraconsistent minimal models (p-minimal models) have been proposed based on multi-valued logic (four-valued logic). Moreover, the paraconsistent relational model is also based on four-valued logic. In this paper, we propose an algorithm, which converts clauses to equations and solves it, to find p-minimal models using the paraconsistent relational model. In order to accomplish that, we use disjunctive paraconsistent relation model.