Paraconsistent Many-Valued Logic in GUHA Framework

Esko Turunen

doi:10.18267/j.aip.116

Paraconsistent Many-Valued Logic in GUHA Framework

Esko Turunen

Research output: Contribution to journal › Article › Scientific › peer-review

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.

Original language	English
Pages (from-to)	104-111
Number of pages	8
Journal	Acta Informatica Pragensia
Volume	7
Issue number	1
DOIs	https://doi.org/10.18267/j.aip.116
Publication status	Published - 3 May 2018
Publication type	A1 Journal article-refereed

Publication forum classification

No publication forum level

Access to Document

10.18267/j.aip.116

Cite this

@article{e3377f773b384e248ca3ee46db7fd429,

title = "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.",

author = "Esko Turunen",

year = "2018",

month = may,

day = "3",

doi = "10.18267/j.aip.116",

language = "English",

volume = "7",

pages = "104--111",

journal = "Acta Informatica Pragensia",

issn = "1805-4951",

publisher = "Prague University of Economics and Business",

number = "1",

}

TY - JOUR

T1 - Paraconsistent Many-Valued Logic in GUHA Framework

AU - Turunen, Esko

PY - 2018/5/3

Y1 - 2018/5/3

N2 - 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.

AB - 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.

U2 - 10.18267/j.aip.116

DO - 10.18267/j.aip.116

M3 - Article

SN - 1805-4951

VL - 7

SP - 104

EP - 111

JO - Acta Informatica Pragensia

JF - Acta Informatica Pragensia

IS - 1

ER -

Paraconsistent Many-Valued Logic in GUHA Framework

Abstract

Publication forum classification

Access to Document

Fingerprint

Cite this