First-order rough logic I: approximate reasoning via rough sets
Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Induction of Classification Rules by Granular Computing
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
The Resolution for Ruogh Propositional Logic with Lower (L) and Upper (h) Approximate Operators
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
A Generalized Decision Logic in Interval-Set-Valued Information Tables
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Propositional logics from rough set theory
Transactions on rough sets VI
Design and implement for diagnosis systems of hemorheology on blood viscosity syndrome based on GrC
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Theoretical study of granular computing
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Rough group, rough subgroup and their properties
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Granular logic with closeness relation "∼λ" and its reasoning
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
| Hi-index | 0.00 |
In this article, Rough Logic is defined as a nonstandard logicon a given information system IS = (U,A). Atomic formulae of the logicare defined as a = v or av. It is interpreted as a(x) = v, where a ∈ A isan attribute in A, x is an individual variable on U, and v is an attributevalue. The compound formula consist of the atomic formulae and logicalconnectives. Semantics of the logic is discussed. Truth value of the roughlogic is defined as a ratio of the number of elements satisfying the logicalformula to the total of elements on U. Deductive reasoning and resolutionreasoning are also studied. The rough logic will offer a new idea forthe applications to classical logic and other nonstandard logic.