Classifying the complexity of constraints using finite algebras

SIAM Journal on Computing

Volumn 34, Issue 3, 2005, Pages 720-742

  Bulatov, Andrei ^a   Jeavons, Peter ^b   Krokhin, Andrei ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Constraint satisfaction problem; Dichotomy theorem; Universal algebra

Indexed keywords

ALGEBRA; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEM; DICHOTOMY THEOREM; RELATIONAL DATABASE THEORY; UNIVERSAL ALGEBRA;

COMBINATORIAL MATHEMATICS;

EID: 20544439895     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700376676     Document Type: Article

References (56)

1. W. BIBEL, Constraint satisfaction from a deductive viewpoint, Artificial Intelligence, 35 (1988), pp. 401-413.
2. M. BODIRSKY AND J. NEŠETŘIL, Constraint satisfaction with countable homogeneous templates, in Proceedings of Computer Science Logic and the 8th Kurt Gödel Colloquium, Lecture Notes in Comput. Sci. 2803, Springer-Verlag, Berlin, 2003, pp. 44-57.
3. A. BULATOV, A dichotomy theorem for constraints on a three-element set, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS'02), Vancouver, BC, Canada, 2002, pp. 649-658.
4. A. BULATOV, Mal'tsev Constraints Are Tractable, Tech. report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
5. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03), Ottawa, ON, Canada, IEEE Press, 2003, pp. 321-330.
6. A. BULATOV AND P. JEAVONS, Tractable Constraints Closed under a Binary Operation, Tech. report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
7. A. BULATOV, A. KROKHIN, AND P. JEAVONS, The complexity of maximal constraint languages, in Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC'01), 2001, pp. 667-674.
8. D. COHEN, P. JEAVONS, P. JONSSON, AND M. KOUBARAKIS, Building tractable disjunctive constraints, J. ACM, 47 (2000), pp. 826-853.
9. P. COHN, Universal Algebra, Mathematics and Its Applications 6, D. Reidel, Dordrecht, The Netherlands, Boston, 1981.
10. M. COOPER, D. COHEN, AND P. JEAVONS, Characterising tractable constraints, Artificial Intelligence, 65 (1994), pp. 347-361.
11. N. CREIGNOU, S. KHANNA, AND M. SUDAN, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
12. V. DALMAU, A new tractable class of constraint satisfaction problems, in Proceedings of the 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
13. V. DALMAU, Constraint satisfaction problems in non-deterministic logarithmic space, in Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02), Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 414-425.
14. V. DALMAU AND J. PEARSON, Set functions and width 1 problems, in Proceedings of the 5th International Conference on Constraint Programming (CP'99), Lecture Notes in Comput. Sci. 1713, Springer-Verlag, Berlin, 1999, pp. 159-173.
15. R. DECHTER AND J. PEARL, Network-based heuristics for constraint satisfaction problems, Artificial Intelligence, 34 (1988), pp. 1-38.
16. K. DENECKE AND S. WISMATH, Universal Algebra and Applications in Theoretical Computer Science, Chapman and Hall/CRC Press, Boca Raton, FL, 2002.
17. T. DRAKENGREN AND P. JONSSON, A complete classification of tractability in Alien's algebra relative to subsets of basic relations, Artificial Intelligence, 106 (1998), pp. 205-219.
18. T. FEDER, Constraint satisfaction on finite groups with near subgroups, submitted; available online from http://theory.stanford.edu/~tomas/near.ps.
19. T. FEDER, P. HELL, AND J. HUANG, List homomorphisms and circular arc graphs, Combinatorica, 19 (1999), pp. 487-505.
20. T. FEDER AND M. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
21. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
22. G. GOTTLOB, L. LEONE, AND F. SCARCELLO, A comparison of structural CSP decomposition methods, Artificial Intelligence, 124 (2000), pp. 243-282.
23. M. GYSSENS, P. JEAVONS, AND D. COHEN, Decomposing constraint satisfaction problems using database techniques, Artificial Intelligence, 66 (1994), pp. 57-89.
24. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
25. D. HOBBY AND R. MCKENZIE, The Structure of Finite Algebras, Contemp. Math. 76, AMS, Providence, RI, 1988.
26. P. JEAVONS, Constructing constraints, in Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Comput. Sci. 1520, Springer-Verlag, London, 1998, pp. 2-16.
27. P. JEAVONS, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci., 200 (1998), pp. 185-204.
28. P. JEAVONS, D. COHEN, AND M. COOPER, Constraints, consistency and closure, Artificial Intelligence, 101 (1998), pp. 251-265.
29. P. JEAVONS, D. COHEN, AND M. GYSSENS, A unifying framework for tractable constraints, in Proceedings of the 1st International Conference on Constraint Programming (CP'95), Lecture Notes in Comput. Sci. 976, Springer-Verlag, 1995, pp. 276-291.
30. P. JEAVONS, D. COHEN, AND M. GYSSENS, Closure properties of constraints, J. ACM, 44 (1997), pp. 527-548.
31. P. JEAVONS, D. COHEN, AND J. PEARSON, Constraints and universal algebra, Ann. Math. Artificial Intelligence, 24 (1998), pp. 51-67.
32. P. JEAVONS AND M. COOPER, Tractable constraints on ordered domains, Artificial Intelligence, 79 (1995), pp. 327-339.
33. L. KIROUSIS, Fast parallel constraint satisfaction, Artificial Intelligence, 64 (1993), pp. 147-160.
34. P. KOLAITIS AND M. VARDI, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci., 61 (2000), pp. 302-332.
35. A. KROKHIN, P. JEAVONS, AND P. JONSSON, Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra, J. ACM, 50 (2003), pp. 591-640.
36. P. LADKIN AND R. MADDUX, On binary constraint problems, J. ACM, 41 (1994), pp. 435-469.
37. S. LANG, Algebra, Grad. Texts in Math., Springer-Verlag, New York, 2002.
38. D. LESAINT, N. AZARMI, R. LAITHWAITE, AND P. WALKER, Engineering dynamic scheduler for work manager, BT Technology J., 16 (1998), pp. 16-29.
39. A. MACKWORTH, Consistency in networks of relations, Artificial Intelligence, 8 (1977), pp. 99-118.
40. A. MACKWORTH, Constraint satisfaction, in Encyclopedia of Artificial Intelligence, Vol. 1, S. Shapiro, ed., Wiley Interscience, New York, 1992, pp. 285-293.
41. A. MACKWORTH AND E. FREUDER, The complexity of constraint satisfaction revisited, Artificial Intelligence, 59 (1993), pp. 57-62.
42. R. MCKENZIE, G. MCNULTY, AND W. TAYLOR, Algebras, Lattices and Varieties, Vol. I, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA, 1987.
43. U. MONTANARI, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci., 7 (1974), pp. 95-132.
44. B. NEBEL AND H.-J. BÜRCKERT, Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra, J. ACM, 42 (1995), pp. 43-66.
45. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
46. J. PEARSON AND P. JEAVONS, A Survey of Tractable Constraint Satisfaction Problems, Tech. report CSD-TR-97-15, Royal Holloway, University of London, London, 1997.
47. N. PIPPENGER, Theories of Computability, Cambridge University Press, Cambridge, UK, 1997.
48. R. PÖSCHEL AND L. KALUŽNIN, Funktionen- und Relationenalgebren, DVW, Berlin, 1979.
49. E. POST, The Two-Valued Iterative Systems of Mathematical Logic, Annals Mathematics Studies 5, Princeton University Press, Princeton, NJ, 1941.
50. L. PURVIS AND P. JEAVONS, Constraint tractability theory and its application to the product development process for a constraint-based scheduler, in Proceedings of the 1st International Conference on the Practical Application of Constraint Technologies and Logic Programming (PACLP'99), The Practical Application Company, Blackpool, UK, 1999, pp. 63-79.
51. J. RENZ AND B. NEBEL, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus, Artificial Intelligence, 108 (1999), pp. 69-123.
52. T. SCHAEPER, The complexity of satisfiability problems, in Proceedings of the 10th ACM Symposium on Theory of Computing (STOC'78), 1978, pp. 216-226.
53. A. SZENDREI, Clones in Universal Algebra, Séminaire de Mathématiques Supérieures 99, University of Montreal Press, Montreal, QC, Canada, 1986.
54. A. SZENDREI, Simple surjective algebras having no proper subalgebras, J. Austral. Math. Soc. Ser. A, 48 (1990), pp. 434-454.
55. A. SZENDREI, Term minimal algebras, Algebra Universalis, 32 (1994), pp. 439-477.
56. P. VAN BEEK AND R. DECHTER, On the minimality and decomposability of row-convex constraint networks, J. ACM, 42 (1995), pp. 543-561.