Binary relations-based rough sets -- an automated approach

DOI10.1515/FORMA-2016-0011zbMath1352.03057OpenAlexW2567347677MaRDI QIDQ502682

Adam Grabowski

Publication date: 6 January 2017

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/forma-2016-0011

zbMATH Keywords

binary relationrough setlower approximationupper approximation

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Reasoning under uncertainty in the context of artificial intelligence (68T37) Mechanization of proofs and logical operations (03B35)

Related Items (4)

Computer Certification of Generalized Rough Sets Based on Relations ⋮ Developing complementary rough inclusion functions ⋮ Formal development of rough inclusion functions ⋮ Formalizing two generalized approximation operators

Uses Software

• Mizar

Cites Work

• Unnamed Item
• Unnamed Item
• Four decades of {\textsc{Mizar}}. Foreword
• Mechanizing complemented lattices within Mizar type system
• Two views of the theory of rough sets in finite universes
• Generalized rough sets based on relations
• Relational Formal Characterization of Rough Sets
• Rough sets
• Efficient Rough Set Theory Merging

This page was built for publication: Binary relations-based rough sets -- an automated approach