Quasi-classical reasoning in paraconsistent databases

Abstract

The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the paraconsistent relational model is capable of representing incomplete and inconsistent data, we propose an algorithm to find QC model for inconsistent positive extended disjunctive deductive databases. We also provide the proof for the algorithm.