A Characterisation of First-Order Constraint Satisfaction Problems


We characterise finite relational core structures admitting finitely many obstructions, in terms of special near unanimity functions, and in terms of dismantling properties of their square. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first-order definable: we show the general problem to be NP… (More)
DOI: 10.2168/LMCS-3(4:6)2007


1 Figure or Table


Citations per Year

110 Citations

Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Larose2006ACO, title={A Characterisation of First-Order Constraint Satisfaction Problems}, author={Benoit Larose and Cynthia Loten and Claude Tardif}, journal={21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)}, year={2006}, pages={201-210} }