We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Some problems not definable using structure homomorphisms.

Madelaine, F. R. and Stewart, I. A. (2003) 'Some problems not definable using structure homomorphisms.', Ars Combinatoria., 67 . pp. 153-159.


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.

Item Type:Article
Keywords:Constraint satisfaction, CSP, MMSNP.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:April 2003
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar