Rough operations on Boolean algebras
From MaRDI portal
Publication:2568267
DOI10.1016/j.ins.2004.06.006zbMath1074.03025OpenAlexW2056901304MaRDI QIDQ2568267
Publication date: 10 October 2005
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://pure.qub.ac.uk/ws/files/12706131/in_sci05.pdf
Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37) Boolean algebras (Boolean rings) (06E99) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items
Rough sets based on complete completely distributive lattice, Rough approximations via ideal on a complete completely distributive lattice, On rough set and fuzzy sublattice, The TL-fuzzy rough approximation operators on a lattice, Roughness in m-semilattices1, An Equivalent Definition of Rough Sets, A short note on algebraic \(T\)-rough sets, Rough approximation operators on \(R_0\)-algebras (nilpotent minimum algebras) with an application in formal logic \(\mathcal{L}^\ast\), On the union and intersection operations of rough sets based on various approximation spaces, Axiomatic approaches to rough approximation operators on complete completely distributive lattices, The algebraic structures of generalized rough set theory, Generalized rough sets over fuzzy lattices, A comparison of two types of rough sets induced by coverings, Rough 3-valued algebras, Matroidal structure of rough sets from the viewpoint of graph theory, Rough set theory applied to lattice theory, Invertible approximation operators of generalized rough sets and fuzzy rough sets, Algebraic aspects of generalized approximation spaces, Reference points and roughness, Rough implication operator based on strong topological rough algebras, Axiomatic approaches to rough approximation operators via ideal on a complete completely distributive lattice, Rough operations and uncertainty measures on MV-algebras, THE PROPERTIES OF ROUGH APPROXIMATIONS, VARIOUS FRAMES AND CONNECTIONS, MODAL, NECESSITY, SUFFICIENCY AND CO-SUFFICIENCY OPERATORS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
- Bayesian probability on Boolean algebras and applications to decision theory
- Interpretations of belief functions in the theory of rough sets
- Constructive and algebraic methods of the theory of rough sets
- Two views of the theory of rough sets in finite universes
- Rough sets
- Algebraic semantics for modal logics I
- The integral in a Boolean algebra
