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

Computational Complexity of Constraint Satisfaction

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

Complexity of Constraints

Basics of Galois Connections

Complexity of Constraints

Partial Polymorphisms and Constraint Satisfaction Problems

Complexity of Constraints

The complexity of satisfiability problems: Refining Schaefer's theorem

Journal of Computer and System Sciences

On the role of logical connectives for primality and functional completeness of algebras of logics

Information Sciences: an International Journal

Generalized modal satisfiability

Journal of Computer and System Sciences

Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms

European Journal of Combinatorics

Intervals of partial clones containing maximal clones

Journal of Automata, Languages and Combinatorics

Ultramodular aggregation functions

Information Sciences: an International Journal

Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?

Electronic Notes in Theoretical Computer Science (ENTCS)

Lewis Dichotomies in Many-Valued Logics

Studia Logica

A functional completeness theorem for De Morgan functions

Discrete Applied Mathematics

Clones with Nullary Operations

Electronic Notes in Theoretical Computer Science (ENTCS)

Dualizing Clones as Models of Lawvere Theories

Electronic Notes in Theoretical Computer Science (ENTCS)

A Short Introduction to Clones

Electronic Notes in Theoretical Computer Science (ENTCS)