Results 21 to 30 of about 686,932 (192)
Representation of Fuzzy Concept Lattices in the Framework of Classical FCA
We describe a representation of the fuzzy concept lattices, defined via antitone Galois connections, within the framework of classical Formal Concept Analysis. As it is shown, all needed information is explicitly contained in a given formal fuzzy context
Peter Butka, Jozef Pócs, Jana Pócsová
doaj +1 more source
Galois lattice theory for probabilistic visual landmarks [PDF]
This paper presents an original application of the Galois lattice theory, the visual landmark selection for topological localization of an autonomous mobile robot, equipped with a color camera.
Samuelides,Manuel +3 more
core +1 more source
Relational Galois connections between transitive fuzzy digraphs [PDF]
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.
Bernard De Baets +9 more
core +1 more source
ESSENTIAL AND RETRACTABLE GALOIS CONNECTIONS [PDF]
For bounded lattices, we introduce certain Galois connections, called (cyclically) essential, retractable and UC Galois connections, which behave well with respect to concepts of module-theoretic nature involving essentiality. We show that essential retractable Galois connections preserve uniform dimension, whereas essential retractable UC Galois ...
openaire +2 more sources
On closure axioms for a matroid using Galois connections [PDF]
We present two systems of closure axioms for a matroid with the assistance of Galois connections. These axioms give a mathematical foundation for the connections between matroids, Galois connections and concept lattices.
Mao, Hua
core +1 more source
On Constructivity of Galois Connections [PDF]
Abstract interpretation-based static analyses rely on abstract domains of program properties, such as intervals or congruences for integer variables. Galois connections (GCs) between posets provide the most widespread and useful formal tool for mathematically specifying abstract domains.
openaire +2 more sources
Galois Connections in Persistent Homology [PDF]
We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings.
Gulen, Aziz Burak, McCleary, Alexander
core
Hilbert Algebras with Hilbert-Galois Connections II
Hilbert algebra with a Hilbert-Galois connection, or HilGC-algebra, is a triple \(\left(A,f,g\right)\) where \(A\) is a Hilbert algebra, and \(f\) and \(g\) are unary maps on \(A\) such that \(f(a)\leq b\) iff \(a\leq g(b)\), and \(g(a\rightarrow b)\leq ...
Sergio A. Celani, Daniela Montagie
doaj +1 more source
This paper is an attempt to develop quantitative domain theory over frames. Firstly, we propose the notion of a fuzzy basis, and several equivalent characterizations of fuzzy bases are obtained.
Sanping Rao, Qingguo Li
doaj +1 more source
An Innovative Approach to Multi‐Valued Logic
The current generation of computer systems operates on the principles of binary logic, which encompasses both logical and arithmetic operations. However, silicon technology has reached its peak performance, prompting researchers to explore alternative methods for enhancing computational efficiency. One such method is the adoption of Multi‐Valued Logic (
Ali Mokhtari, Peyman Kabiri
wiley +1 more source

