Lattice Theory for Rough Sets
From MaRDI portal
Publication:3591006
DOI10.1007/978-3-540-71200-8_22zbMath1186.03069MaRDI 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
06A06: Partial orders, general
03E72: Theory of fuzzy sets, etc.
68T30: Knowledge representation
06B05: Structure theory of lattices
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS, Computer Certification of Generalized Rough Sets Based on Relations, Topological structures in rough set theory: A survey, Towards Logics of Some Rough Perspectives of Knowledge, Approximation Schemes in Logic and Artificial Intelligence, Pseudo-Kleene algebras determined by rough sets, Rough set theory applied to finite dimensional vector spaces, Stone lattices., Covering-based rough sets and modal logics. I., Information completeness in Nelson algebras of rough sets induced by quasiorders, Soft rough approximation operators on a complete atomic Boolean lattice, Connections between covering-based rough sets and concept lattices, The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm, 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, Approximation of sets based on partial covering, Representation of Nelson algebras by rough sets determined by quasiorders, An application of rough sets to graph theory, A unifying study between modal-like operators, topologies and fuzzy sets, From quantale algebroids to topological spaces: fixed- and variable-basis approaches, Algebraic aspects of generalized approximation spaces, Rough sets determined by quasiorders, Algebraic structures in the vicinity of pre-rough algebra and their logics. II, Rough sets and matroids from a lattice-theoretic viewpoint, A comprehensive study of implicator-conjunctor-based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis, On topological spaces generated by simple undirected graphs, Defining rough sets using tolerances compatible with an equivalence, Defining rough sets as core-support pairs of three-valued functions, Finding strongly connected components of simple digraphs based on granulation strategy, Formalizing two generalized approximation operators, 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, Logics from Galois connections, Rough sets determined by tolerances, Note on topologies induced by coverings of approximation spaces, Attribute reduction using functional dependency relations in rough set theory, Extended-order algebras as a generalization of posets, 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, Categorical Innovations for Rough Sets
