The following pages link to Lattice Theory for Rough Sets (Q3591006):
Displaying 43 items.
- Stone lattices. (Q271910) (← links)
- Covering-based rough sets and modal logics. I. (Q313134) (← links)
- Information completeness in Nelson algebras of rough sets induced by quasiorders (Q383570) (← links)
- Soft rough approximation operators on a complete atomic Boolean lattice (Q459998) (← links)
- Connections between covering-based rough sets and concept lattices (Q473370) (← links)
- The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm (Q484442) (← links)
- Partial order relation for approximation operators in covering based rough sets (Q508651) (← links)
- On the union and intersection operations of rough sets based on various approximation spaces (Q508955) (← links)
- Approximation of sets based on partial covering (Q642525) (← links)
- Representation of Nelson algebras by rough sets determined by quasiorders (Q647309) (← links)
- An application of rough sets to graph theory (Q712705) (← links)
- A unifying study between modal-like operators, topologies and fuzzy sets (Q881822) (← links)
- From quantale algebroids to topological spaces: fixed- and variable-basis approaches (Q969582) (← links)
- Algebraic aspects of generalized approximation spaces (Q990971) (← links)
- Rough sets determined by quasiorders (Q1047187) (← links)
- Algebraic structures in the vicinity of pre-rough algebra and their logics. II (Q1671252) (← links)
- Rough sets and matroids from a lattice-theoretic viewpoint (Q1671721) (← links)
- A comprehensive study of implicator-conjunctor-based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis (Q1677213) (← links)
- On topological spaces generated by simple undirected graphs (Q2132127) (← links)
- Defining rough sets using tolerances compatible with an equivalence (Q2215060) (← links)
- Defining rough sets as core-support pairs of three-valued functions (Q2237201) (← links)
- Finding strongly connected components of simple digraphs based on granulation strategy (Q2302953) (← links)
- Formalizing two generalized approximation operators (Q2311527) (← links)
- Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets. (Q2353687) (← links)
- Duality, conjugacy and adjointness of approximation operators in covering-based rough sets (Q2353691) (← links)
- Logics from Galois connections (Q2379337) (← links)
- Rough sets determined by tolerances (Q2453623) (← links)
- Note on topologies induced by coverings of approximation spaces (Q2658033) (← links)
- Attribute reduction using functional dependency relations in rough set theory (Q2670889) (← links)
- Extended-order algebras as a generalization of posets (Q3099662) (← links)
- Algebraic Methods for Granular Rough Sets (Q3299868) (← links)
- Irredundant Coverings, Tolerances, and Related Algebras (Q3299870) (← links)
- Topological Properties for Approximation Operators in Covering Based Rough Sets (Q3300261) (← links)
- Formalizing Lattice-Theoretical Aspects of Rough and Fuzzy Sets (Q3300368) (← links)
- Categorical Innovations for Rough Sets (Q3628686) (← links)
- REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS (Q4576930) (← links)
- Computer Certification of Generalized Rough Sets Based on Relations (Q5082208) (← links)
- Topological structures in rough set theory: A survey (Q5162950) (← links)
- Towards Logics of Some Rough Perspectives of Knowledge (Q5245316) (← links)
- Approximation Schemes in Logic and Artificial Intelligence (Q5505446) (← links)
- Pseudo-Kleene algebras determined by rough sets (Q6178731) (← links)
- Rough set theory applied to finite dimensional vector spaces (Q6197195) (← links)
- A topological approach to rough sets from a granular computing perspective (Q6492622) (← links)
