Paraconsistent Many-Valued Logic in GUHA Framework

Abstract

The primary aim of this paper is to establish a formal connection between a particular many–valued paraconsistent logic and the logic of a KDD method, namely the GUHA data mining method by introducing a new quantifier called Paraconsistent Separation quantifier. This quantifier is implemented to LISp–Miner Software. The secondary aim is to demonstrate a possible usefulness of this quantifier in social and other applied sciences by examples taking from family planning context.