A dichotomy theorem for constraints on a three-element set

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 649-658

  Bulatov, Andrei A ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING; TIME SHARING PROGRAMS;

CONSTRAINT SATISFACTION PROBLEM; DICHOTOMY THEOREM; POLYNOMIAL TIME ALGORITHM;

COMPUTER SCIENCE;

EID: 0036964534     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. J. Allen. Natural Language Understanding. Benjamin Cummihgs, 1994.
2. A. Bulatov. Mal'tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
3. A. Bulatov. Tractable constraints on a three-element set. Technical Report PRG-RR-02-06, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
4. A. Bulatov and P. Jeavons. Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK, 2000.
5. A. Bulatov and P. Jeavons. Algebraic approach to multi-sorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK, 2001.
6. A. Bulatov and P. Jeavons. Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische universität Dresden, Dresden, Germany, 2001.
7. A. Bulatov, P. Jeavons, and K. A.A. The complexity of maximal constraint languages. In Proceedings of the 33rd Annual ACM Simposium on Theory of Computing, pages 667-674, Hersonissos, Crete, Greece, July 2001, ACM Press.
8. A. Bulatov, A. Krokhin, and P. Jeavons. Constraint satisfaction problems and finite algebras. In Proceedings of 27th International Colloquium on Automata, Languages and Programming-ICALP'00, volume 1853 of Lecture Notes in Computer Science, pages 272-282, Springer-Verlag, 2000.
9. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. SIAM, 2001.
10. V. Dalmau. Computational Complexity of Problems over Generalised Formulas. PhD thesis, Department LSI of the Universitat Politecnica de Catalunya (UPC), Barcelona., March, 2000.
11. R. Dechter and A. Dechter. Structure-driven algorithms for truth maintenance. Artificial Intelligence, 82(1-2):1-20, 1996.
12. R. Dechter and I. Meiri. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68:211-241, 1994.
13. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34(1):1-38, 1988.
14. T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing, 28:57-104, 1998.
15. G. Gottlob, L. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243-282, 2000.
16. P. Jeavons. Constructing constraints. In Proceedings 4th International Conference on Constraint Programming-CP'98 (Pisa, October 1998), volume 1520 of Lecture Notes in Computer Science, pages 2-16, Springer-Verlag, 1998.
17. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
18. P. Jeavons, D. Cohen, and M. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101 (1-2):251-265, 1998.
19. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
20. P. Jeavons, D. Cohen, and J. Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence, 24:51-67, 1998.
21. P. Kolaitis and M. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61:302-332, 2000.
22. V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1):32-44, 1992.
23. R. McKenzie, G. McNulty, and W. Taylor. Algebras, Lattices and Varieties, volume 1, Wadsworth and Brooks, California, 1987.
24. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95-132, 1974.
25. B. Nadel. Constraint satisfaction in Prolog: Complexity and theory-based heuristics. Information Sciences, 83(3-4):113-131, 1995.
26. B. Nadel and J. Lin. Automobile transmission design as a constraint satisfaction problem: Modeling the kinematik level. Artificial Intelligence for Engineering Design, Analysis and Manufacturing (AI EDAM), 5(3):137-171, 1991.
27. R. Pöschel and L. Kalužnin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
28. E. Post. The two-valued iterative systems of mathematical logic, volume 5 of Annals Mathematical Studies. Princeton University Press, 1941.
29. T. Schaefer. The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing (STOC'78), pages 216-226, 1978.
30. E. Schwalb and L. Vila. Temporal constraints: a survey. Constraints, 3(2-3):129-149, 1998.
31. A. Szendrei. Clones in Universal Algebra, volume 99 of Seminaires de Mathematiques Superieures. University of Montreal, 1986.
32. A. Szendrei. Simple surjective algebras having no proper subalgebras. Journal of the Australian Mathematical Society (Series A), 48:434-454, 1990.
33. M. Vardi. Constraint satisfaction and database theory: a tutorial. In Proceedings of 19th ACM Symposium on Priciples of Database Systems (PODS '00), 2000.