Paraconsistent Many-Valued Logic in GUHA Framework

Esko Turunen

Acta Informatica Pragensia, 2018, vol. 2018, issue 1, 104-111

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.

Keywords: KDD; paraconsistent logic; many-; valued logic (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://aip.vse.cz/doi/10.18267/j.aip.116.html (text/html)
http://aip.vse.cz/doi/10.18267/j.aip.116.pdf (application/pdf)
free of charge

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:prg:jnlaip:v:2018:y:2018:i:1:id:116:p:104-111

Ordering information: This journal article can be ordered from
Redakce Acta Informatica Pragensia, Katedra systémové analýzy, Vysoká škola ekonomická v Praze, nám. W. Churchilla 4, 130 67 Praha 3
http://aip.vse.cz

DOI: 10.18267/j.aip.116

Access Statistics for this article

Acta Informatica Pragensia is currently edited by Editorial Office

More articles in Acta Informatica Pragensia from Prague University of Economics and Business Contact information at EDIRC.
Bibliographic data for series maintained by Stanislav Vojir ().