Paraconsistent Many–Valued Logic in GUHA Framework

Esko Turunen

Paraconsistent Many–Valued Logic in GUHA Framework

Číslo: 1/2018
Periodikum: Acta Informatica Pragensia
ISBN: 1805-4951
DOI: 10.18267/j.aip.116

Klíčová slova: KDD, paraconsistent logic, many–valued logic, KDD, paralelní logika, mnohohodnotová logika

Pro získání musíte mít účet v Citace PRO.

Přečíst po přihlášení

Anotace: 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.