A Bilattice-based Approach to Recover Consistent Data from Inconsistent Knowledge-Bases

Bilaitices, which have been shown to be very useful in logic programming, are used here for recovering consistent data from an inconsistent knowledge-base. Our method is conservative in the sense that it considers the contradictory data as useless, and regards all the remaining information unaffected. This kind of approach is nonmonotonic and paraconsistent in nature.