Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
From MaRDI portal
Publication:677078
DOI10.1023/A:1004939914902zbMath0864.03040OpenAlexW1548712546MaRDI QIDQ677078
Publication date: 31 March 1997
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004939914902
generalized rough setsdiscernibilityBrouwer-Zadeh structuresfuzzy-intuitionistic algebras with modalitiesgeneralized rough approximation mappingpreclusivityrough representation
Related Items
The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Dependency structures for decision tables ⋮ On the order-theoretic properties of lower concept formula systems ⋮ Dependency and accuracy measures for directed graphs ⋮ Granular computing on information tables: families of subsets and operators ⋮ Pseudo-Kleene algebras determined by rough sets ⋮ Algebraic models of deviant modal operators based on De Morgan and Kleene lattices ⋮ Information systems in modeling interactive computations on granules ⋮ Matroidal approaches to rough sets via closure operators ⋮ Dominance-Based Rough Set Approach and Bipolar Abstract Rough Approximation Spaces ⋮ Algebraic Methods for Orthopairs and Induced Rough Approximation Spaces ⋮ Preclusivity and Simple Graphs ⋮ Preclusivity and Simple Graphs: The n–cycle and n–path Cases ⋮ Some minimal axiom sets of rough sets ⋮ New Approach in Defining Rough Approximations ⋮ An application of rough sets to graph theory ⋮ Interactive information systems: toward perception based computing ⋮ A HISTORICAL OVERVIEW OF FUZZY MATHEMATICS ⋮ Bets and boundaries: Assigning probabilities to imprecisely specified events ⋮ Lattices with Interior and Closure Operators and Abstract Approximation Spaces ⋮ Constructive and algebraic methods of the theory of rough sets ⋮ Approximation operator based on neighborhood systems
