Reasoning about concepts by rough mereological logics

Authors:
Lech Polkowski;Maria Semeniuk-Polkowska
Affiliations:
Polish-Japanese Institute of Information Technology, Warsaw, Poland;Warsaw University, Warsaw, Poland
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 5
Cited 3

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations

Rough Sets: Mathematical Foundations
A note on 3-valued rough logic accepting decision rules

Fundamenta Informaticae
On Rough Set Logics Based on Similarity Relations

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Rough mereology in analysis of vagueness

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology

Choice inclusive general rough semantics

Information Sciences: an International Journal
A Logic-Algebraic Approach to Graded Inclusion

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Dialectics of counting and the mathematics of vagueness

Transactions on Rough Sets XV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rough mereology allows for similarity measures (called rough inclusions) which in turn form a basis for the mechanism of granulation of knowledge. Granules of knowledge, defined as classes of satisfactorily similar objects, can be regarded as worlds in which properties of entities are evaluated. Obtained in this way granular rough mereological intensional logics reveal essential properties of rough set based reasoning. We present in this work the essential facts about these logics.