A Characterisation of First-Order Constraint Satisfaction Problems

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Larose, B., Loten, C., Tardif, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Character recognition
Combinatorial mathematics
Computer science
Constraint theory
Educational institutions
Graph theory
Logic
Polynomials
Relational databases
Statistics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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-complete, and give a polynomial-time algorithm in the case of cores
ISSN:1043-6871
2575-5528
DOI:10.1109/LICS.2006.6