Formalizing two generalized approximation operators
From MaRDI portal
Publication:2311527
DOI10.2478/forma-2018-0016zbMath1422.68222OpenAlexW2908006987WikidataQ128644858 ScholiaQ128644858MaRDI QIDQ2311527
Michał Sielwiesiuk, Adam Grabowski
Publication date: 10 July 2019
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/forma-2018-0016
Reasoning under uncertainty in the context of artificial intelligence (68T37) Mechanization of proofs and logical operations (03B35)
Related Items (3)
Developing complementary rough inclusion functions ⋮ Automated Comparative Study of Some Generalized Rough Approximations ⋮ Formal development of rough inclusion functions
Uses Software
Cites Work
- Unnamed Item
- Introduction to formal preference spaces
- Binary relations-based rough sets -- an automated approach
- Two views of the theory of rough sets in finite universes
- Formalization of generalized almost distributive lattices.
- Generalized rough sets based on relations
- Relational Formal Characterization of Rough Sets
- Mizar: State-of-the-art and Beyond
- On Duplication in Mathematical Repositories
- Lattice Theory for Rough Sets
- Rough sets
- Lattice Theory for Rough Sets – A Case Study with Mizar
- Mathematical Knowledge Management
- Automated Discovery of Properties of Rough Sets
This page was built for publication: Formalizing two generalized approximation operators