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.
|Keywords:||Constraint satisfaction, CSP, MMSNP.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://bkocay.cs.umanitoba.ca/arscombinatoria/vol67.html|
|Record Created:||29 Jun 2009 15:35|
|Last Modified:||07 Aug 2009 13:06|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|