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