Possible Rough Ingredients of Concepts in Approximation Spaces

Authors:
Anna Gomolińska
Affiliations:
Department of Mathematics University of Białystok Akademicka 2, 15267 Białystok, Poland. E-mail: anna.gom@math.uwb.edu.pl
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 9
Cited 5

Tolerance approximation spaces

Fundamenta Informaticae - Special issue: rough sets
Rough mereology in information systems. A case study: qualitative spatial reasoning

Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Toward Intelligent Systems: Calculi of Information Granules

Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
On a Mereological System for Relational Software Specifications

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Rough Mereology

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Basic mereology with equivalence relations

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Algebras of Approximating Regions

Fundamenta Informaticae - Qualitative Spatial Reasoning
On Connection Synthesis via Rough Mereology

Fundamenta Informaticae - Qualitative Spatial Reasoning

Nearness of Objects: Extension of Approximation Space Model

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On Three Closely Related Rough Inclusion Functions

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
On Certain Rough Inclusion Functions

Transactions on Rough Sets IX
Nearness approximation space based on axiomatic fuzzy sets

International Journal of Approximate Reasoning
Satisfiability judgement under incomplete information

Transactions on Rough Sets XI

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the problem of rough ingredients and parts of concepts of an indiscernibility-based approximation space. The notion of a (rough) ingredient is extended to the notion of a possible (rough) ingredient, and analogously in the case of parts. The term "possible" means that a concept is perceived as a candidate for a future substitute of some ingredient. Our approach is in line with rough mereology except for allowing the empty concept for the sake of simplicity.