Rough sets determined by tolerances

DOI10.1016/j.ijar.2013.12.005zbMath1392.06002arXiv1303.6332OpenAlexW2005312531MaRDI QIDQ2453623

Jouni Järvinen, Sándor Radeleczki

Publication date: 10 June 2014

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.6332

zbMATH Keywords

knowledge representationrough setconcept latticeortholatticetolerance relationrepresentation of lattices

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Complete lattices, completions (06B23) Representation theory of lattices (06B15) Complemented lattices, orthocomplemented lattices and posets (06C15) Other generalizations of distributive lattices (06D75)

Related Items (13)

REPRESENTING REGULAR PSEUDOCOMPLEMENTED KLEENE ALGEBRAS BY TOLERANCE-BASED ROUGH SETS ⋮ Many Faces of Lattice Tolerances ⋮ Defining rough sets using tolerances compatible with an equivalence ⋮ Irredundant Coverings, Tolerances, and Related Algebras ⋮ Limited approximate bisimulations and the corresponding rough approximations ⋮ Defining rough sets as core-support pairs of three-valued functions ⋮ Modal systems for covering semantics and boundary operator ⋮ Rough approximations based on bisimulations ⋮ Partial order relation for approximation operators in covering based rough sets ⋮ Blocks of the Direct Product of Tolerance Relations ⋮ The Structure of Multigranular Rough Sets ⋮ Matrix-based set approximations and reductions in covering decision information systems ⋮ Lattices defined by multigranular rough sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information completeness in Nelson algebras of rough sets induced by quasiorders
• On some types of neighborhood-related covering rough sets
• Representation of Nelson algebras by rough sets determined by quasiorders
• Covering based rough set approximations
• Nelson algebras through Heyting ones. I
• Rough sets determined by quasiorders
• The class of Kleene algebras satisfying an interpolation property and Nelson algebras
• Information systems theoretical foundations
• Extensions and intensions in the rough set theory
• Rough set approach to incomplete information systems
• Generalization of Pawlak's rough approximation spaces by using \(\delta \beta \)-open sets
• 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
• Lattice Theory for Rough Sets
• Esoteric Rough Set Theory: Algebraic Semantics of a Generalized VPRS and VPFRS
• Rough sets
• Rough Sets and Current Trends in Computing
• Incomplete information: Structure, inference, complexity

This page was built for publication: Rough sets determined by tolerances