A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
There are no pure relational width 2 constraint satisfaction problems
Information Processing Letters
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Introduction to the Maximum Solution Problem
Complexity of Constraints
Maximal infinite-valued constraint languages
Theoretical Computer Science
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
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
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Maximal infinite-valued constraint languages
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In the constraint satisfaction problem CSP(H) corresponding to a finite relational structure H, the aim is to decide, given a relational structure G, whether there exists a homomorphism from G to H.In [Tractable conservative constraint satisfaction problems], we proved that if H is a conservative structure, then it can be associated with a complete edge-3-colored graph whose vertex set is the universe of H.The complexity and a solution algorithm for CSP(H) strongly depend on certain properties of the associated graph.In this paper we show how a similar edge-3-colored graph can be defined for an arbitrary finite relational structure H.Then we study properties of the defined graph and find a solution algorithm for CSP(H), where G(H) satisfies some restrictions.The latter result substantially generalizes the results of [1, 8, 12, 25, 27] concerning max-closed constraints and constraints with a 2-semilattice, semigroup or conservative groupoid polymorphism.Finally, we complete the study of the complexity of maximal constraint languages started in [The complexity of maximal constraint languages].