A Graded Meaning of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A normal form which preserves tautologies and contradictions in a class of fuzzy logics
Journal of Algorithms
Some Proof Theoretic Results Depending on Context from the Perspective of Graded Consequence
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Pawlak's landscaping with rough sets
Transactions on rough sets VI
Fuzzy Sets and Systems
Introduction, elimination rules for ¬ and ⊃: a study from graded context
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
A Graded Meaning of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
| Hi-index | 0.00 |