Abstract
The problem of approximating an arbitrary binary relation by a partial order is formally defined and analysed. Five different partial order approximations of an arbitrary binary relation are provided and their relationships analysed. Both the classical relational algebra model and a model based on the Rough Set paradigm are discussed. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Janicki, R. (2011). Approximations of arbitrary binary relations by partial orders: Classical and rough set models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6499 LNCS, pp. 17–38). https://doi.org/10.1007/978-3-642-18302-7_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
