Let the pair (U, A) be an information system, where U is a collection of objects, the universe, and A is a finite set of attributes. If we consider a subset B of the set of attributes A, we can associate with B an indiscernibility relation on U, and thus a partition of the set U. Endow U with a partial order, obtaining a partially ordered set P, and consider an information system having P as universe. In this piece of work we investigate the notion of indiscernibility relation on a such information system. In particular, we introduce the notion of compatibility between an indiscernibility relation I on U and the partially ordered set P, and we establish a criterion for I to be compatible with P.
Indiscernibility relations on partially ordered sets / P. Codara - In: 2011 IEEE international conference on granular computing, Kaohsiung, Taiwan, nov.8-10, 2011 : proceedings / [a cura di] T.-P. Hong [et al.]. - Los Alamitos : IEEE, 2011. - ISBN 9781457703713. - pp. 150-155 (( convegno IEEE International Conference on Granular Computing tenutosi a Kaohsiung, Taiwan nel 2011 [10.1109/GRC.2011.6122584].
Indiscernibility relations on partially ordered sets
P. CodaraPrimo
2011
Abstract
Let the pair (U, A) be an information system, where U is a collection of objects, the universe, and A is a finite set of attributes. If we consider a subset B of the set of attributes A, we can associate with B an indiscernibility relation on U, and thus a partition of the set U. Endow U with a partial order, obtaining a partially ordered set P, and consider an information system having P as universe. In this piece of work we investigate the notion of indiscernibility relation on a such information system. In particular, we introduce the notion of compatibility between an indiscernibility relation I on U and the partially ordered set P, and we establish a criterion for I to be compatible with P.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.