Reduction on Propositional Logic Set based on Correlation Analysis
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, use...
Saved in:
Main Author: | Huilai, Zhi (Author) |
---|---|
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2014-07-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Bisection Method for Information System Knowledge Reduction
by: Huilai, Zhi
Published: (2014) -
AN OVERVIEW OF JAPANESE MODALITIES AND THEIR DEGREE OF PROPOSITION
by: Imtihani, Najih
Published: (2012) -
Task view reduction Algorithm based on Rough sets in Gloud Storage
by: Xu, Yiyi
Published: (2014) -
New types of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/Off-Set, Neutrosophic Refined Set, and their Extension to Plithogenic Set/Logic/Probability, with Applications
by: Smarandache, Florentin
Published: (2019) -
Fuzzy Sets, Fuzzy Logic and Their Applications
by: Voskoglou, Michael
Published: (2020)