scientific article; zbMATH DE number 4201689
From MaRDI portal
Publication:3350830
zbMATH Open0727.68114MaRDI QIDQ3350830FDOQ3350830
Authors: Stephen D. Comer 
Publication date: 1991
Title of this publication is not available (Why is that?)
Recommendations
Cited In (54)
- Rough sets determined by quasiorders
- Axiomatization of covering-based approximation operators generated by general or irreducible coverings
- On interval-valued hesitant fuzzy rough approximation operators
- Estimating information amount under uncertainty: algorithmic solvability and computational complexity
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatic approaches to rough approximation operators on complete completely distributive lattices
- On characterizations of \((\mathcal J,\mathcal T)\)-fuzzy rough approximation operators
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- The minimization of axiom sets characterizing generalized approximation operators
- Title not available (Why is that?)
- Generalized fuzzy rough sets determined by a triangular norm
- Real-valued hemimetric-based fuzzy rough sets and an application to contour extraction of digital surfaces
- Information algebras in the theory of imprecise probabilities, an extension
- Rudiments of rough sets
- Information algebras
- On axiomatic characterizations of three pairs of covering based approximation operators
- Extended-order algebras as a generalization of posets
- The comparative study of covering rough sets and multi-granulation rough sets
- Properties of determinate knowledge systems
- An axiomatic approach of fuzzy rough sets based on residuated lattices
- Approximation operator based on neighborhood systems
- Title not available (Why is that?)
- An information complexity approach to extended formulations
- Finite information systems
- Constructive and axiomatic approaches of fuzzy approximation operators.
- An incidence algebra approach to knowledge granulation in Pawlak information systems
- Information algebra induced by information systems
- Approximation and information topologies
- Title not available (Why is that?)
- Boolean connection algebras: A new approach to the Region-Connection Calculus
- Title not available (Why is that?)
- New approach in defining rough approximations
- Some minimal axiom sets of rough sets
- Title not available (Why is that?)
- Minimization of axiom sets on fuzzy approximation operators
- Title not available (Why is that?)
- Constructive and algebraic methods of the theory of rough sets
- A logic for rough sets
- An axiomatic characterization of a fuzzy generalization of rough sets.
- Rough approximations based on bisimulations
- On minimization of axiom sets characterizing covering-based approximation operators
- On generalized intuitionistic fuzzy rough approximation operators
- Algebraic representation, dualities and beyond
- Characterization of rough set approximations in atanassov intuitionistic fuzzy set theory
- Algebras of intervals and a logic of conditional assertions
- Algebras of Terms in Pawlak’s Information Systems
- Three lessons on the topological and algebraic hidden core of rough set theory
- Rough 3-valued algebras
- Title not available (Why is that?)
- Information Algebra
- Title not available (Why is that?)
- Information algebras and consequence operators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3350830)
