Rough Sets and Infomorphisms: Towards Approximation of Relations in Distributed Environments

Authors:
Andrzej Skowron;Jarosław Stepaniuk;James F. Peters
Affiliations:
Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland;Department of Computer Science, Białystok University of Technology, Wiejska 45A, 15-351 Białystok, Poland;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 5V6, Canada
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Year:
2003

Citing 10
Cited 5

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Information flow: the logic of distributed systems

Information flow: the logic of distributed systems
Readings in agents

Readings in agents
Rough mereological foundations for design, analysis, synthesis, and control in distributed systems

Information Sciences: an International Journal - From rough sets to soft computing
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems

Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough-Fuzzy Hybridization: A New Trend in Decision Making

Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Neuro-Computing: Techniques for Computing with Words

Rough-Neuro-Computing: Techniques for Computing with Words
Computing with Words in Information/Intelligent Systems 2: Applications

Computing with Words in Information/Intelligent Systems 2: Applications
Towards an Ontology of Approximate Reason

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Calculi of Approximation Spaces

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Modelling Complex Patterns by Information Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Complex Patterns

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Concept Formation: Rough Sets and Scott Systems

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the relationships between information systems and classifications as well as between infomorphisms and definability of relations (between whole objects and their parts) in information systems. Infomorphisms between information systems (classifications) IS_1 and IS_2 make it possible to define some formulas over IS_2 by means of formulas over IS_1. The remaining formulas over IS_2 can be approximatively defined by means of formulas over IS_1. The approximation operations are defined using the rough set approach. We present definitions and examples of such approximations.