Conference
Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models
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.
Authors
Janicki R
Series
Lecture Notes in Computer Science
Volume
6499
Pagination
pp. 17-38
Publisher
Springer Nature
Publication Date
2011
DOI
10.1007/978-3-642-18302-7_2
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743