Regular Article: Universal Graphs with Forbidden Subgraphs and Algebraic Closure
Advances in Applied Mathematics
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Constraint Satisfaction, Logic and Forbidden Patterns
SIAM Journal on Computing
European Journal of Combinatorics
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
Forbidden patterns problems are a generalisation of (finite) constraint satisfaction problems which are definable in Feder and Vardi's logic MMSNP [1]. In fact, they are examples of infinite constraint satisfaction problems with nice model theoretic properties introduced by Bodirsky [2]. In previous work [3], we introduced a normal form for these forbidden patterns problems which allowed us to provide an effective characterisation of when a problem is a finite or infinite constraint satisfaction problem. One of the central concepts of this normal form is that of a recolouring. In the presence of a recolouring from a forbidden patterns problem Ω1 to another forbidden patterns problem Ω2, containment of Ω1 in Ω2 follows. The converse does not hold in general and it remained open whether it did in the case of problems being given in our normal form. In this paper, we prove that this is indeed the case. We also show that the recolouring problem is Π2p-hard and in Σ3p.