Preclusivity and simple graphs
DOI10.1007/978-3-319-25783-9_12zbMATH Open1444.68199OpenAlexW2403448715MaRDI QIDQ3300262FDOQ3300262
Authors: Davide Ciucci, F. Infusino, G. Chiaselotti, T. Gentile
Publication date: 28 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_12
Recommendations
formal concept analysisundirected graphssufficiency operatorpreclusivity relationtheory of opposition
Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
- The structure of oppositions in rough set theory and formal concept analysis -- toward a new bridge between the two settings
- Title not available (Why is that?)
- Brouwer-Zadeh posets and three-valued Łukasiewicz posets
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- An application of rough sets to graph theory
- Mathematical aspects of concept analysis
- Title not available (Why is that?)
- Simple Undirected Graphs as Formal Contexts
- Duality in rough set theory based on the square of opposition
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Rough Set Theory and Digraphs
Cited In (10)
- Indiscernibility structures induced from function sets: graph and digraph case
- The adjacency matrix of a graph as a data table: a geometric perspective
- Decision systems in rough set theory: a set operatorial perspective
- New perspectives of granular computing in relation geometry induced by pairings
- Dependency and accuracy measures for directed graphs
- Notions from rough set theory in a generalized dependency relation context
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Dependency structures for decision tables
- Simple graphs in granular computing
- Precedence thinness in graphs
This page was built for publication: Preclusivity and simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300262)