Basics of Galois Connections

Authors:
Ferdinand Börner
Affiliations:
Institut für Informatik, Universität Potsdam, Potsdam, D---14 439
Venue:
Complexity of Constraints
Year:
2008

Citing 9
Cited 1

Closure properties of constraints

Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems

Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems
The complexity of maximal constraint languages

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An algebraic approach to hyperalgebras

ISMVL '96 Proceedings of the 26th International Symposium on Multiple-Valued Logic
Hyperclones on a finite set

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Partial Hyperclones on a Finite Set

ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)

Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)

An algebraic theory of complexity for valued constraints: establishing a Galois connection

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an overview of basic properties of Galois connections between sets of relations and sets of functions or generalized functions. First we focus on the Galois connections lnv ---Pol and lnv ---mPol . Then we use these results to provide some tools for the representation of several closure operators on relations as closure operators of some Galois connections.