Paraconsistent Many-Valued Logic in GUHA Framework
Tutkimustuotos › › vertaisarvioitu
Standard
Paraconsistent Many-Valued Logic in GUHA Framework. / Turunen, Esko.
julkaisussa: Acta Informatica Pragensia, University of Economics, Prague, Vuosikerta 7, Nro 1, 03.05.2018, s. 104-111.Tutkimustuotos › › vertaisarvioitu
Harvard
APA
Vancouver
Author
Bibtex - Lataa
}
RIS (suitable for import to EndNote) - Lataa
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
VL - 7
SP - 104
EP - 111
JO - Acta Informatica Pragensia, University of Economics, Prague
JF - Acta Informatica Pragensia, University of Economics, Prague
SN - 1805-4951
IS - 1
ER -