A Characterisation of First-Order Constraint Satisfaction Problems

Autor:	Benoit Larose, Cynthia Loten, Claude Tardif
Jazyk:	angličtina
Rok vydání:	2007
Předmět:	computer science - logic in computer science computer science - computational complexity f.4.1 Logic BC1-199 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Logical Methods in Computer Science, Vol Volume 3, Issue 4 (2007)
Druh dokumentu:	article
ISSN:	1860-5974 69907692
DOI:	10.2168/LMCS-3(4:6)2007
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/3ec3983f0f404c699076926fdd5fd768 Zobrazit plný text záznamu View record in DOAJ