Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough mereology in information systems. A case study: qualitative spatial reasoning
Rough set methods and applications
Knowledge discovery by application of rough set models
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Inclusion degree: a perspetive on measures for rough set data analysis
Information Sciences—Informatics and Computer Science: An International Journal
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
On Certain Rough Inclusion Functions
Transactions on Rough Sets IX
Rough Approximation Based on Weak q-RIFs
Transactions on Rough Sets X
Rough mereology in analysis of vagueness
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Reasoning about concepts by rough mereological logics
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Rough mereological classifiers obtained from weak variants of rough inclusions
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Approximate Reasoning by Parts: An Introduction to Rough Mereology
Approximate Reasoning by Parts: An Introduction to Rough Mereology
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
In this article we continue searching for functions which might be used as measures of inclusion of information granules in information granules. Starting with a 3-valued logic having an adequate logical matrix, we show how to derive a corresponding graded inclusion function. We report on the results of examination of several best known 3-valued logics in this respect. We also give some basic properties of the inclusion functions obtained. (A preliminary version of this article was presented at the Workshop on Concurrency, Specification and Programming (CS&P'2010) held in Helenenau b. Berlin, Germany [9]. Many thanks to the anonymous referees for useful comments and to Marcin Wolski for help with word processing. The author kindly acknowledges the usage of Paul Taylor's TeX macros for drawing commutative diagrams. The research has been supported by grants N N516 368334 and N N516 077837 from Ministry of Science and Higher Education of the Republic of Poland.)