Soft rough approximation operators on a complete atomic Boolean lattice

DOI10.1155/2013/486321zbMath1296.68168OpenAlexW2024010388WikidataQ59027994 ScholiaQ59027994MaRDI QIDQ459998

Heba. I. Mustafa

Publication date: 13 October 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/486321

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

On modified soft rough sets on a complete atomic Boolean lattice

Cites Work

• Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
• Soft sets and soft rough sets
• On soft topological spaces
• Rudiments of rough sets
• Rough sets: some extensions
• A fuzzy soft set theoretic approach to decision making problems
• Soft sets and soft groups
• Extending soft sets with description logics
• Soft sets combined with fuzzy sets and rough sets: a tentative approach
• Lattice-valued logic. An alternative approach to treat fuzziness and incomparability
• An application of soft sets in a decision making problem.
• Soft set theory
• Soft set theory -- first results
• Rough 3-valued algebras
• L-fuzzy sets
• Lattice Theory for Rough Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Soft rough approximation operators on a complete atomic Boolean lattice