Some problems not definable using structure homomorphisms
Madelaine, F.R.; Stewart, I.A.
We exhibit some problems definable in Feder and Vardi's logic MMSNP that are not in the class CSP of constraint satisfaction problems. Whilst some of these problems have previously been shown to be in MMSNP (that is, definable in MMSNP) but not in CSP, existing proofs are probabilistic in nature. We provide explicit combinatorial constructions to prove that these problems are not in CSP and we use these constructions to exhibit yet more problems in MMSNP that are not in CSP.
Madelaine, F., & Stewart, I. (2003). Some problems not definable using structure homomorphisms. Ars combinatoria, 67, 153-159
|Journal Article Type||Article|
|Publication Date||Apr 1, 2003|
|Deposit Date||Jun 29, 2009|
|Publisher||Charles Babbage Research Centre|
|Peer Reviewed||Peer Reviewed|
|Keywords||Constraint satisfaction, CSP, MMSNP.|
You might also like
Constraint satisfaction, logic and forbidden patterns
Dichotomies for classes of homomorphism problems involving unary functions
Bounded-degree Forbidden-Pattern Problems are Constraint Satisfaction Problems
Using semidirect products of groups to build classes of interconnection networks
Variational networks of cube-connected cycles are recursive cubes of rings