Defining rough sets using tolerances compatible with an equivalence
From MaRDI portal
Publication:2215060
DOI10.1016/J.INS.2019.05.030zbMath1451.68274arXiv1811.09609OpenAlexW2900716762MaRDI QIDQ2215060
Publication date: 10 December 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09609
knowledge representationset coveringrough setequivalence relationtolerance relationcompletely distributive complete lattice
Theory of fuzzy sets, etc. (03E72) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (2)
Partially-defined equivalence relations: relationship with orthopartitions and connection to rough sets ⋮ The Structure of Multigranular Rough Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic for reasoning about relative similarity
- Covering based rough set approximations
- Representation of nondeterministic information
- Information systems theoretical foundations
- The structure of distributive double p-algebras. Regularity and congruences
- MGRS: a multi-granulation rough set
- Rough sets determined by tolerances
- Data analysis based on discernibility and indiscernibility
- Semiorders and a Theory of Utility Discrimination
- Lattice Theory for Rough Sets
- Rough sets
- REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS
- Information algebras
- Multi-granulation fuzzy rough sets
This page was built for publication: Defining rough sets using tolerances compatible with an equivalence