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. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Codara, P. (2012). On the structure of indiscernibility relations compatible with a partially ordered set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7268 LNAI, pp. 47–55). Springer Verlag. https://doi.org/10.1007/978-3-642-29350-4_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
