Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Characterising tractable constraints
Artificial Intelligence
Homomorphisms to oriented paths
Discrete Mathematics
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Existence of Homomorphisms to Oriented Cycles
SIAM Journal on Discrete Mathematics
On homomorphisms to acyclic local tournaments
Journal of Graph Theory
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Duality theorems for finite structures (characterising gaps and good characterisations)
Journal of Combinatorial Theory Series B
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
SIAM Journal on Discrete Mathematics
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Homomorphism Closed vs. Existential Positive
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
SIAM Journal on Discrete Mathematics
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
Majority functions on structures with finite duality
European Journal of Combinatorics
Bi-arc graphs and the complexity of list homomorphisms
Journal of Graph Theory
Maltsev + Datalog -- Symmetric Datalog
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Caterpillar Duality for Constraint Satisfaction Problems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Constraints, consistency and closure
Artificial Intelligence
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
Tree dualities for constraint satisfaction
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Graph partitions with prescribed patterns
European Journal of Combinatorics
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 0.02 |
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality, and bounded treewidth duality.