A Characterisation of First-Order Constraint Satisfaction Problems

Details A Characterisation of First-Order Constraint Satisfaction Problems A Characterisation of First-Order Constraint Satisfaction Problems

2007-07-17

arxiv.org/abs/0707.2562v2

LMCS 3 (4:6) 2007

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-3(4:6)2007

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. 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-complete, and give a polynomial-time algorithm in the case of cores. A slight modification of this algorithm provides, for first-order definable CSP's, a simple poly-time algorithm to produce a solution when one exists. As an application of our algebraic characterisation of first order CSP's, we describe a large family of L-complete CSP's.

Affiliated with

Also associated with

No associations

Rating

A Characterisation of First-Order Constraint Satisfaction Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Characterisation of First-Order Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterisation of First-Order Constraint Satisfaction Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563202