Preclusivity and simple graphs

DOI10.1007/978-3-319-25783-9_12MaRDI QIDQ3300262zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-25783-9_12

zbMATH Keywords

formal concept analysisundirected graphssufficiency operatorpreclusivity relationtheory of opposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Recommendations

• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• Rough Set Theory Applied to Simple Undirected Graphs
• scientific article; zbMATH DE number 1927334
• Simple Undirected Graphs as Formal Contexts
• Graphical partitions and graphical relations

Cites work

• scientific article; zbMATH DE number 41025 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1303618 (Why is no real title available?)
• scientific article; zbMATH DE number 1735914 (Why is no real title available?)
• scientific article; zbMATH DE number 927110 (Why is no real title available?)
• An application of rough sets to graph theory
• Brouwer-Zadeh posets and three-valued Łukasiewicz posets
• Duality in rough set theory based on the square of opposition
• From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
• Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
• Graph theory
• Mathematical aspects of concept analysis
• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• Rough Set Theory and Digraphs
• Simple Undirected Graphs as Formal Contexts
• The structure of oppositions in rough set theory and formal concept analysis -- toward a new bridge between the two settings

Cited in

(10)

• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• New perspectives of granular computing in relation geometry induced by pairings
• Dependency structures for decision tables
• Indiscernibility structures induced from function sets: graph and digraph case
• Decision systems in rough set theory: a set operatorial perspective
• The adjacency matrix of a graph as a data table: a geometric perspective
• Dependency and accuracy measures for directed graphs
• Simple graphs in granular computing
• Notions from rough set theory in a generalized dependency relation context
• 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)