Lattice Theory for Rough Sets
From MaRDI portal
Publication:3591006
DOI10.1007/978-3-540-71200-8_22zbMath1186.03069OpenAlexW1535538569MaRDI QIDQ3591006
Publication date: 3 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71200-8_22
Partial orders, general (06A06) Theory of fuzzy sets, etc. (03E72) Knowledge representation (68T30) Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items
Stone lattices. ⋮ On topological spaces generated by simple undirected graphs ⋮ Covering-based rough sets and modal logics. I. ⋮ Logics from Galois connections ⋮ Note on topologies induced by coverings of approximation spaces ⋮ Computer Certification of Generalized Rough Sets Based on Relations ⋮ Algebraic structures in the vicinity of pre-rough algebra and their logics. II ⋮ Rough sets and matroids from a lattice-theoretic viewpoint ⋮ REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS ⋮ A unifying study between modal-like operators, topologies and fuzzy sets ⋮ A comprehensive study of implicator-conjunctor-based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis ⋮ Information completeness in Nelson algebras of rough sets induced by quasiorders ⋮ Attribute reduction using functional dependency relations in rough set theory ⋮ Pseudo-Kleene algebras determined by rough sets ⋮ Rough set theory applied to finite dimensional vector spaces ⋮ Approximation of sets based on partial covering ⋮ Representation of Nelson algebras by rough sets determined by quasiorders ⋮ Defining rough sets using tolerances compatible with an equivalence ⋮ Soft rough approximation operators on a complete atomic Boolean lattice ⋮ Connections between covering-based rough sets and concept lattices ⋮ Rough sets determined by tolerances ⋮ The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm ⋮ Algebraic Methods for Granular Rough Sets ⋮ Irredundant Coverings, Tolerances, and Related Algebras ⋮ Topological Properties for Approximation Operators in Covering Based Rough Sets ⋮ Formalizing Lattice-Theoretical Aspects of Rough and Fuzzy Sets ⋮ Defining rough sets as core-support pairs of three-valued functions ⋮ Partial order relation for approximation operators in covering based rough sets ⋮ On the union and intersection operations of rough sets based on various approximation spaces ⋮ Topological structures in rough set theory: A survey ⋮ From quantale algebroids to topological spaces: fixed- and variable-basis approaches ⋮ An application of rough sets to graph theory ⋮ Algebraic aspects of generalized approximation spaces ⋮ Categorical Innovations for Rough Sets ⋮ Finding strongly connected components of simple digraphs based on granulation strategy ⋮ Formalizing two generalized approximation operators ⋮ Extended-order algebras as a generalization of posets ⋮ Towards Logics of Some Rough Perspectives of Knowledge ⋮ Rough sets determined by quasiorders ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets. ⋮ Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
