Abstract
The idea of using antichains of rough objects was suggested by the present author in her earlier papers. In this research basic aspects of such semantics are considered over general rough sets and general approximation spaces over quasi-equivalence relations. Most of the considerations are restricted to semantics associated with maximal antichains and their meaning. It is shown that even when the approximation operators are poorly behaved, some semantics with good structure and computational potential can be salvaged.
Author supplied keywords
Cite
CITATION STYLE
Mani, A. (2015). Antichain based semantics for rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9436, pp. 335–346). Springer Verlag. https://doi.org/10.1007/978-3-319-25754-9_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
