A characterisation of first-order constraint satisfaction problems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 201-210

  Larose, Benoit ^a   Loten, Cynthia ^b   Tardif, Claude ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b ROYAL MILITARY COLLEGE OF CANADA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEMS; NEAR-UNANIMITY FUNCTIONS; POLYNOMIAL TIME ALGORITHM;

CONSTRAINT THEORY;

EID: 34547307238     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.6     Document Type: Conference Paper

References (17)

1. A. Atserias, On Digraph Coloring Problems and Treewidth Duality, in Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, LICS 2005 106-115, 2005.
2. A. Bulatov, A. Krokhin, P. Jeavons. Constraint satisfaction problems and finite algebras. In ICALP'00, volume 1853 of LNCS, 272-282, 2000.
3. V. Dalmau, P. Kolaitis, M. Vardi, Constraint satisfaction, bounded treewidth, and finite-variable logics, in Constraint Programming '02, (LNCS 2002) 310-326, 2002.
4. V. Dalmau, A. Krokhin, Majority constraints have bounded path duality, preprint, 17 pages, 2006.
5. V. Dalmau, A. Krokhin, B. Larose, First-order definable retraction problems for posets and reflexive graphs, in Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), IEEE, 232-241, 2004.
6. V. Dalmau, J. Pearson, Closure Functions and Width 1 Problems, in Proc. Principles and Practice of Constraint Programming - CP'99, 5th International Conference, Alexandria, Virginia, Lecture Notes in Computer Science 1713 Springer 1999, 159-173.
7. T. Feder, M. Y. Vardi, Monotone monadic SNP and constraint satisfaction, in Proceedings of the 25rd Annual ACM Symposium on Theory of Computing (STOC), San Diego, California, (1993), 612-622.
8. T. Feder, M. Y. Vardi, The Computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory, SIAM Journal of Computing 28, (1998), 57-104.
9. P. Hell, J. Nešetŗil, On the complexity of H-coloring, J. Combin. Theory Ser. B 48, 1990, 92-110.
10. P. G. Kolaitis, M. Y Vardi, A game-theoretic approach to constraint satisfaction, in 7th National Conference on Artificial Intelligence, 175-181, 2000.
11. G. Kun, Cs. Szabó, Order varieties and monotone retractions of finite posets, Order 18, 79-88, 2001.
12. B. Larose, L. Zádori, Bounded width problems and algebras, Algebra Universalis, 25 pages, to appear.
13. L. Lovász, Operations with structures, Acta Math. Acad. Sci. Hungar 18, 1967, 321-328.
14. M. Maróti, The existence of a near-unanimity term in a finite algebra is decidable, preprint, 13 pages, 2005.
15. J. Nešetřil, C. Tardif, Duality theorems for finite structures (characterising gaps and good characterisations), J. Combin. Theory Ser. B 80, 2000, 80-97.
16. J. Nešetřil, C. Tardif, Short answers to exponentially long questions: Extremal aspects of homomorphism duality, SIAM Journal on Discrete Mathematics, 7 pages, to appear.
17. B. Rossman, Existential Positive Types and Preservation under Homomorphisms, in Proceedings of the Twentieth Annual IEEE Symp. on Logic in Computer Science, (LICS), 467-476, 2005.