A characterisation of first-order constraint satisfaction problems

Logical Methods in Computer Science

Volumn 3, Issue 4, 2007, Pages

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

^a Civil and Environmental Engineering   (Canada)

^b UNIVERSITY OF THE FRASER VALLEY   (Canada)

^c ROYAL MILITARY COLLEGE OF CANADA   (Canada)

Author keywords

Constraint satisfaction problems; Finite duality; First order logic; Tree duality

Indexed keywords

ALGEBRA; CHARACTERIZATION; CONSTRAINT THEORY; FORMAL LOGIC; POLYNOMIAL APPROXIMATION;

CORE STRUCTURE; FINITE DUALITY; FIRST ORDER; FIRST ORDER LOGIC; NP COMPLETE; POLY-TIME ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; TREE DUALITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85025078284     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(4:6)2007     Document Type: Article

References (15)

1. E. Allender, M. Bauland, N. Immerman, H. Schnoor, and H. Vollmer. The complex-ity of satisfiability problems: Refining Schaefer’s theorem. In Proc. 30th Math. Found. Of Comp. Sci. (MFCS’05), pages 71-82, 2005.
2. A. Atserias. On Digraph Coloring Problems and Treewidth Duality. Proceedings of the Twentieth Annual IEEE Symp. On Logic in Computer Science (LICS 2005), 106-115, 2005.
3. A. Bulatov, A. Krokhin, P. Jeavons. Constraint satisfaction problems and finite algebras. In ICALP’00, volume 1853 of LNCS, 272-282, 2000.
4. D. Cohen and P. G. Jeavons. The Complexity of Constraint Languages, in Handbook of Con-straint Programming (F. Rossi, P. van Beek, T. Walsh eds.), chapter 8, Elsevier, 2006, 978 pp.
5. V. Dalmau. Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science, 1(1), 2005.
6. V. Dalmau, P. Kolaitis, M. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics, in Constraint Programming ’02, (LNCS 2002) 310-326, 2002.
7. L. Egri, B. Larose, and P. Tesson. Symmetric Datalog and constraint satisfaction problems in logspace. Submitted, 2007.
8. 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.
9. 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.
10. P. Jeavons. On the algebraic structure of combinatorial problems Theoret. Comput. Sci. 200 no. 1-2, 185-204, 1998.
11. B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction prob-lems. ICALP 2007, 267-278.
12. J. Nešetřil, C. Tardif. Duality theorems for finite structures (characterising gaps and good char-acterisations). J. Combin. Theory Ser. B 80, 2000, 80-97.
13. J. Nešetřil, C. Tardif. Short answers to exponentially long questions: extremal aspects of homo-morphism duality. SIAM J. Discrete Math. 19, 2005, 914-920
14. 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.
15. T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM STOC, pages 216-226, 1978.