On lower and upper intension order relations by different cover concepts

DOI10.1016/j.ins.2011.04.041zbMath1242.68313OpenAlexW2051296236MaRDI QIDQ433038

S. Abd El Aziz, M. H. Ghanim, Heba. I. Mustafa

Publication date: 13 July 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.04.041

zbMATH Keywords

Boolean algebracoverdouble stone algebralower intension inclusionsrepresentative coverupper intension inclusions

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Pseudocomplemented lattices (06D15) Structure theory of Boolean algebras (06E05)

Cites Work

• A new algebraic structure for formal concept analysis
• Approaches to knowledge reduction of covering decision systems based on information theory
• On axiomatic characterizations of three pairs of covering based approximation operators
• Topological approaches to covering rough sets
• Rudiments of rough sets
• Rough sets: some extensions
• Rough sets and Boolean reasoning
• Fuzzy rough set theory for the interval-valued fuzzy information systems
• The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models
• Relationship between generalized rough sets based on binary relation and covering
• Injective double Stone algebras
• Extensions and intensions in the rough set theory
• Constructive and algebraic methods of the theory of rough sets
• Reduction and axiomization of covering generalized rough sets.
• Constructive and axiomatic approaches of fuzzy approximation operators.
• Rules in incomplete information systems
• Textural approach to generalized rough sets based on relations
• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• Rough set theory for the interval-valued fuzzy information systems
• Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
• Rough sets
• Rough Set Approximations in Formal Concept Analysis
• Local and Global Approximations for Incomplete Data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On lower and upper intension order relations by different cover concepts