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.
On the structure of indiscernibility relations compatible with a partially ordered set / P. Codara - In: Artificial intelligence and soft computing : 11th international conference, ICAISC 2012, Zakopane, Poland, april 29-May 3, 2012 : proceedings, part II / [a cura di] L. Rutkowski, M. Korytkowski, R. Scherer, R. Tadeusiewicz, L.A. Zadeh, J.M. Zurada. - Berlin : Springer, 2012. - ISBN 9783642293498. - pp. 47-55 (( Intervento presentato al 11. convegno International Conference on Artificial Intelligence and Soft Computing (ICAISC) tenutosi a Zakopane, Poland nel 2012 [10.1007/978-3-642-29350-4_6].
On the structure of indiscernibility relations compatible with a partially ordered set
P. CodaraPrimo
2012
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
