Relational Galois connections between transitive fuzzy digraphs

Fuzzy-directed graphs are often chosen as the data structure to model and implement solutions to several problems in the applied sciences. Galois connections have also shown to be useful both in theoretical and in practical problems. In this paper, the notion of relational Galois connection is extended to be applied between transitive fuzzy directed graphs. In this framework, the components of the connection are crisp relations satisfying certain reasonable properties given in terms of the so-called full powering

Workshop Notes of the Sixth International Workshop "What can FCA do for Artificial Intelligence?"

International audienc