Results 1 to 10 of about 686,932 (192)
Formal Contexts, Formal Concept Analysis, and Galois Connections [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying these to formal ...
Jeffrey T. Denniston +2 more
doaj +3 more sources
Constructive Galois Connections [PDF]
Journal of Functional Programming, 2019 Abstract Galois connections are a foundational tool for structuring abstraction in semantics, and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections using proof assistants remains limited to restricted modes of use, preventing their general application in
David Darais, David Van Horn
openaire +3 more sources
Compatibilities between continuous semilattices
Karpatsʹkì Matematičnì Publìkacìï, 2021 We define compatibilities between continuous semilattices as Scott continuous functions from their pairwise cartesian products to $\{0,1\}$ that are zero preserving in each variable.
O.Ya. Mykytsey, K.M. Koporkh
doaj +1 more source
Coloring Rings in Species [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species.
Jacob White
doaj +1 more source
Rough sets based on Galois connections
International Journal of Applied Mathematics and Computer Science, 2020 Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one.
Madrid Nicolás +2 more
doaj +1 more source
Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields
Mathematics, 2021 Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy and idempotent semirings.
Francisco José Valverde-Albacete +1 more
doaj +1 more source
Programming from Galois connections [PDF]
The Journal of Logic and Algebraic Programming, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shin-Cheng Mu, José Nuno Oliveira
openaire +6 more sources
A short note on Simulation and Abstraction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This short note is written in celebration of David Schmidt's sixtieth birthday. He has now been active in the program analysis research community for over thirty years and we have enjoyed many interactions with him. His work on characterising simulations
Chris Hankin
doaj +1 more source
Relating non-Hermitian and Hermitian quantum systems at criticality
SciPost Physics Core, 2023 We demonstrate three types of transformations that establish connections between Hermitian and non-Hermitian quantum systems at criticality, which can be described by conformal field theories (CFTs).
Chang-Tse Hsieh, Po-Yao Chang
doaj +1 more source
Constructive Galois connections: taming the Galois connection framework for mechanized metatheory [PDF]
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016 Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections remains limited to restricted modes of use, preventing their general application in mechanized metatheory and certified programming. This
David Darais, David Van Horn
openaire +4 more sources