scientific article; zbMATH DE number 1303618

Publication date: 9 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Partial orders, general (06A06) Knowledge representation (68T30) Complemented lattices, orthocomplemented lattices and posets (06C15)

Related Items

Topological structures of a type of granule based covering rough sets, Approaches to knowledge reduction of covering decision systems based on information theory, Triangle algebras: A formal logic approach to interval-valued residuated lattices, A complete fuzzy logical system to deal with trust management systems, On the coverings by tolerance classes, A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, On axiomatic characterizations of three pairs of covering based approximation operators, Notions from rough set theory in a generalized dependency relation context, On definable concepts of rough set models, (\(\vartheta, T\))-fuzzy rough approximation operators and the \(TL\)-fuzzy rough ideals on a ring, Generalized rough sets based on neighborhood systems and topological spaces, Relationship among basic concepts in covering-based rough sets, Rudiments of rough sets, Properties of approximation operators over 1-neighborhood systems from the perspective of special granules, Rough sets and matroids from a lattice-theoretic viewpoint, Topological approach to retrieve missing values in incomplete information systems, On generalizing covering approximation space, Choice inclusive general rough semantics, Algebraic models of deviant modal operators based on De Morgan and Kleene lattices, Unnamed Item, Matroidal approaches to rough sets via closure operators, Reduction and axiomization of covering generalized rough sets., Measuring roughness of generalized rough sets induced by a covering, Algebraic Methods for Rough Approximation Spaces by Lattice Interior–Closure Operations, Algebraic Methods for Granular Rough Sets, Three Lessons on the Topological and Algebraic Hidden Core of Rough Set Theory, A New Subsystem-Based Definition of Generalized Rough Set Model, Preclusivity and Simple Graphs, Preclusivity and Simple Graphs: The n–cycle and n–path Cases, A novel method for attribute reduction of covering decision systems, Limited approximate bisimulations and the corresponding rough approximations, Rough approximations based on bisimulations, Rough approximation operators on \(R_0\)-algebras (nilpotent minimum algebras) with an application in formal logic \(\mathcal{L}^\ast\), An entropy-based uncertainty measurement approach in neighborhood systems, On measurements of covering rough sets based on granules and evidence theory, Relationships between generalized rough sets based on covering and reflexive neighborhood system, New Approach in Defining Rough Approximations, The characterizations of upper approximation operators based on special coverings, A systematic study on attribute reduction with rough sets based on general binary relations, Communication between information systems with covering based rough sets, Axiomatization and conditions for neighborhoods in a covering to form a partition, Covering rough sets based on neighborhoods: an approach without using neighborhoods, Generalized rough approximations in Ł\(\Pi \frac{1}{2}\), The fourth type of covering-based rough sets, An application of rough sets to graph theory, Accuracy of approximation operators during covering evolutions, Lattices with Interior and Closure Operators and Abstract Approximation Spaces, Rough Approximation Based on Weak q-RIFs, Two Pairs of Operators in Degree Induced Covering Rough Set, The characterizations of upper approximation operators based on coverings, On characterizations of a pair of covering-based approximation operators, Belief functions and rough sets: survey and new insights, Monadic pseudo-equality algebras, Approximation operator based on neighborhood systems, Fuzzy sets, Topological properties of a pair of relation-based approximation operators, Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets