Closed systems of functions and predicates

Cited in

(only showing first 100 items - show all)

Affine systems of equations and counting infinitary logic
The complexity of satisfiability problems: Refining Schaefer's theorem
A combinatorial constraint satisfaction problem dichotomy classification conjecture
Algebras of prime cardinality with a cyclic automorphism
The subalgebra systems of direct powers
On the algebraic structure of combinatorial problems
Galois connection for multiple-output operations
Unique inclusions of maximal C-clones in maximal clones
On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
On orders of closed classes containing a homogeneous switching function
Taylor's modularity conjecture and related problems for idempotent varieties
Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
A general Galois theory for operations and relations in arbitrary categories
Lewis dichotomies in many-valued logics
On finitely related semigroups.
Critical relations of crowns in critical times of coronavirus depression
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
Existence of cube terms in finite algebras
Solution sets of systems of equations over finite lattices and semilattices
The size of generating sets of powers
Finite degree clones are undecidable
Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions
Functional clones and expressibility of partition functions
What makes propositional abduction tractable
Deciding absorption in relational structures
Weak bases of Boolean co-clones
The existence of a near-unanimity function is decidable
The completeness problem in partial hyperclones
CSP for binary conservative relational structures
The constraint satisfaction problem and universal algebra
A short introduction to clones.
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
Robustly solvable constraint satisfaction problems
The lattice of alter egos
Complexity Classifications for Logic-Based Argumentation
Characterization of preclones by matrix collections
Counting the relations compatible with an algebra
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Galois theory for semiclones
Strong partial clones and the time complexity of SAT problems
Finitely Many Primitive Positive Clones
Meet-irreducible submaximal clones determined by nontrivial equivalence relations
Galois theory for sets of operations closed under permutation, cylindrification, and composition
scientific article; zbMATH DE number 6970794 (Why is no real title available?)
Colouring, constraint satisfaction, and complexity
\(n\)-permutability and linear Datalog implies symmetric Datalog
Extension of not everywhere defined functions of many-valued logic
Natural duality via a finite set of relations
An algebraic hardness criterion for surjective constraint satisfaction.
A general duality theory for clones
Boolean max-co-clones
scientific article; zbMATH DE number 6973795 (Why is no real title available?)
Clones of (continuous) partial cofunctions
scientific article; zbMATH DE number 7359806 (Why is no real title available?)
Absorption in universal algebra and CSP
Quantified Constraints in Twenty Seventeen
Polymorphism-homogeneity and universal algebraic geometry
The lattice and semigroup structure of multipermutations
On the strength of uniqueness quantification in primitive positive formulas
Time complexity of constraint satisfaction via universal algebra
\(n\)-permutability is not join-prime for \(n\geq 5\)
A dichotomy theorem for the inverse satisfiability problem
scientific article; zbMATH DE number 7301721 (Why is no real title available?)
Conditions for maximality of subclones
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
Rigid binary relations on a 4-element domain
A complete classification of equational classes of threshold functions included in clones
Gap theorems for robust satisfiability: Boolean CSPs and beyond
Quantified constraint satisfaction problem on semicomplete digraphs
Clones with finitely many relative \({\mathcal R}\)-classes
A Generalized Version of the Baker–Pixley Theorem
Topological Birkhoff
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
Basics of Galois Connections
Constraint Satisfaction Problems with Infinite Templates
Partial Polymorphisms and Constraint Satisfaction Problems
Strong subalgebras and the constraint satisfaction problem
All centralising monoids with majority witnesses on a four-element set
A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
On the use of majority for investigating primeness of 3-permutability
Topology and Adjunction in Promise Constraint Satisfaction
Generalized satisfiability problems via operator assignments
Closed classes of functions, generalized constraints, and clusters
The algebraic structure of the densification and the sparsification tasks for CSPs
An algebraic characterization of tractable constraints
The lattice of clones of self-dual operations collapsed
Constraint satisfaction problem: what makes the problem easy
Galois theory for analogical classifiers
Submaximal clones over a three-element set up to minor-equivalence
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
Exploring new topologies for the theory of clones
Multisorted Boolean clones determined by binary relations up to minion homomorphisms
Forbidden tournaments and the orientation completion problem
Ivo G. Rosenberg's work on maximal clones and minimal clones
Quantifiers closed under partial polymorphisms
Network satisfaction problems solved by k-consistency
An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
Trichotomies in the complexity of minimal inference
On the expression complexity of equivalence and isomorphism of primitive positive formulas

This page was built for publication: Closed systems of functions and predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2536623)