Reduction on Propositional Logic Set based on Correlation Analysis

Zhi Huilai


A knowledge base is redundant if it contains parts that can be inferred from the rest of it. In this paper, with no district bound, we study the reduction theory and algorithm on proposition logic set. The propositions of a given proposition set fall into three categories: necessary proposition, useful proposition, and useless proposition. A reduction of a given set is composed of all the necessary propositions and some useful propositions. At the beginning we introduce induced formal context of proposition set, and then propose the method of reduction on proposition set based on correlation analysis.

Full Text:




  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics