On the structure of indiscernibility relations compatible with a partially ordered set

Authors:
Pietro Codara
Affiliations:
Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Milan, Italy
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 4
Cited 0

Rough set approach to incomplete information systems

Information Sciences: an International Journal
Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis
The algebraic structures of generalized rough set theory

Information Sciences: an International Journal
Open Partitions and Probability Assignments in Gödel Logic

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recently published work the author investigates indiscernibility relations on information systems with a partially ordered universe. Specifically, he introduces a notion of compatibility between the (partially ordered) universe and an indiscernibility relation on its support, and establishes a criterion for compatibility. In this paper we make a first step in the direction of investigating the structure of all the indiscernibility relations which satisfy such a compatibility criterion.