Chapter 8 The complexity of constraint languages

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 245-280

  Cohen, David ^a   Jeavons, Peter ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956755575     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80012-X     Document Type: Chapter

References (92)

1. Allen J.F. Maintaining knowledge about temporal intervals. Communications of the ACM 26 (1983) 832-843
2. Atserias A. On digraph coloring problems and treewidth duality. Proceedings 20th IEEE Symposium on Logic in Computer Science (LICS 2005) (2005) 106-115
3. M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. To appear in the the Journal of Logic and Computation.
4. Bodirsky M., and Nešetřil J. Constraint satisfaction with countable homogeneous templates. Proceedings of Computer Science Logic and the 8th Kurt Gödel Colloquium. Lecture Notes in Computer Science volume 2803 (2003), Springer-Verlag, Vienna 44-57
5. Boerner F., Bulatov A., Jeavons P., and Krokhin A. Quantified constraints: Algorithms and complexity. Proceedings of Computer Science Logic and the 8th Kurt Gödel Colloquium. Lecture Notes in Computer Science volume 2803 (2003), Springer 58-70
6. Broxvall M., Jonsson P., and Renz J. Disjunctions, independence, refinements. Artificial Intelligence 140 1-2 (2002) 153-173
7. Bulatov A. H-coloring dichotomy revisited. Theoretical Computer Science 349 1 (2005) 31-39
8. A. Bulatov and V. Dalmau. Mal'tsev constraints are tractable. SIAM Journal on Computing. (To appear).
9. Bulatov A., and Dalmau V. Towards a dichotomy theorem for the counting constraint satisfaction problem. Proceedings 44th Symposium on Foundations of Computer Science (FOCS 2003) (2003), IEEE Computer Society 562-573
10. Bulatov A., and Jeavons P. An algebraic approach to multi-sorted constraints. Proceedings 9th International Conference on Constraint Programming-CP'03 (Kinsale, September 2003). Lecture Notes in Computer Science volume 2833 (2003), Springer-Verlag 183-198
11. Bulatov A., Krokhin A., and Jeavons P. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
12. Bulatov A., Jeavons P., and Volkov M. Finite semigroups imposing tractable constraints. Proceedings of the School on Algorithmic Aspects of the Theory of Semigroups and its Applications, Coimbra, Portugal, 2001 (2002), World Scientific 313-329
13. Bulatov A., and Skvortsov E. Amalgams of constraint satisfaction problems. Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003) (2003), Morgan Kaufmann 197-202
14. Vancouver, Canada. Bulatov A.A. A dichotomy theorem for constraints on a three-element set. Proceedings 43rd IEEE Symposium on Foundations of Computer Science (FOCS'02) (2002) 649-658
15. Bulatov A.A. Mal'tsev constraints are tractable. Technical Report PRG-RR-02-05 (2002), Computing Laboratory, University of Oxford
16. Bulatov A.A. Tractable conservative constraint satisfaction problems. Proceedings 18th IEEE Symposium on Logic in Computer Science (LICS'03) (2003), IEEE Press, Ottawa, Canada 321-330
17. Bulatov A.A., and Jeavons P.G. Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00 (2002), Computing Laboratory, University of Oxford
18. Bulatov A.A., Krokhin A.A., and Jeavons P.G. Constraint satisfaction problems and finite algebras. Proceedings 27th International Colloquium on Automata, Languages and Programming (ICALP'00). Lecture Notes in Computer Science volume 1853 (2000), Springer-Verlag, Oxford, UK 272-282
19. Bulatov A.A., Krokhin A.A., and Jeavons P.G. The complexity of maximal constraint languages. Proceedings 33rd ACM Symposium on Theory of Computing (STOC'01) (2001) 667-674
20. Cohen D. Tractable decision for a constraint language implies tractable search. Constraints 9 (2004) 219-229
21. Cohen D., Cooper M., and Jeavons P. A complete characterization of complexity for Boolean constraint optimization problems. Proceedings 10th International Conference on Constraint Programming-CP'04. Lecture Notes in Computer Science volume 3258 (2004), Springer-Verlag 212-226
22. Cohen D., Cooper M., Jeavons P., and Krokhin A. Soft constraints: Complexity and multimorphisms. Proceedings 9th International Conference on Constraint Programming-CP'03 (Kinsale, September 2003). Lecture Notes in Computer Science volume 2833 (2003), Springer-Verlag 244-258
23. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research (JAIR) 22 (2004) 1-22
24. Cohen D.A., Jeavons P.G., and Gault R.L. New tractable classes from old. Constraints 8 (2003) 263-282
25. Cohen D.A., Jeavons P.G., Jonsson P., and Koubarakis M. Building tractable disjunctive constraints. Journal of the ACM 47 (2000) 826-853
26. Cooper M.C., Cohen D.A., and Jeavons P.G. Characterising tractable constraints. Artificial Intelligence 65 (1994) 347-361
27. Creignou N., Khanna S., and Sudan M. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications volume 7 (2001), Society for Industrial and Applied Mathematics
28. Dalmau V. A new tractable class of constraint satisfaction problems. Proceedings 6th International Symposium on Artificial Intelligence and Mathematics (2000)
29. Dalmau V. Generalized majority-minority operations are tractable. Proceedings 20th IEEE Symposium on Logic in Computer Science, (LICS 2005) (2005), IEEE Computer Society, Philadelphia, PA 438-447
30. Dalmau V. Linear datalog and bounded path duality of relational structures. Logical Methods in Computer Science 1 (2005) 1-32
31. Dalmau V., Gavaldà R., Tesson P., and Thérien D. Tractable clones of polynomials over semigroups. Proceedings 11th International Conference on Constraint Programming-CP'05. Sitges, October 2005. Lecture Notes in Computer Science volume 3709 (2005), Springer-Verlag 196-210
32. Dechter R. Constraint Processing (2003), Morgan Kaufmann
33. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 1 (1988) 1-38
34. Denecke K., and Wismath S.L. Universal Algebra and Applications in Theoretical Computer Science (2002), Chapman and Hall/CRC Press
35. Deville Y., Barette O., and van Hentenryck P. Constraint satisfaction over connected row convex constraints. Proceedings of IJCAI'97 (1997) 405-411
36. Drakengren T., and Jonsson P. A complete classification of tractability in Allen's algebra relative to subsets of basic relations. Artificial Intelligence 106 (1998) 205-219
37. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28 (1998) 57-104
38. Garey M., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
39. Gault R.L., and Jeavons P. Implementing a test for tractability. Constraints 9 (2004) 139-160
40. Gottlob G., Leone L., and Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence 124 (2000) 243-282
41. Gottlob G., Leone L., and Scarcello F. Hypertree decomposition and tractable queries. Journal of Computer and System Sciences 64 3 (2002) 579-627
42. Grohe M. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Proceedings 44th Annual IEEE Symposium on Foundations of Computer Science, (FOCS'03) (2003) 552-561
43. Gyssens M., Jeavons P.G., and Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66 1 (1994) 57-89
44. Hell P., and Nešetřil J. On the complexity of H-coloring. Journal of Combinatorial Theory, Ser.B 48 (1990) 92-110
45. Hobby D., and McKenzie R.N. The Structure of Finite Algebras. Contemporary Mathematics volume 76 (1988), American Mathematical Society, San Francisco, CA.
46. Hodges W. A Shorter Model Theory (1997), Cambridge University Press, Providence, R.I.
47. Immerman N. Descriptive Complexity. Texts in Computer Science (1998), Springer-Verlag
48. Jeavons P.G. Constructing constraints. Proceedings 4th International Conference on Constraint Programming-CP'98 (Pisa, October 1998). Lecture Notes in Computer Science volume 1520 (1998), Springer-Verlag 2-16
49. Jeavons P.G. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
50. Jeavons P.G., Cohen D.A., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
51. Jeavons P.G., Cohen D.A., and Gyssens M. A unifying framework for tractable constraints. Proceedings 1st International Conference on Constraint Programming, CP'95. Lecture Notes in Computer Science volume 976 (1995), Springer-Verlag 276-291
52. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
53. Jeavons P.G., Cohen D.A., and Gyssens M. How to determine the expressive power of constraints. Constraints 4 (1999) 113-131
54. Jeavons P.G., and Cooper M.C. Tractable constraints on ordered domains. Artificial Intelligence 79 2 (1995) 327-339
55. Jonsson P., and Bäckström C. A unifying approach to temporal constraint reasoning. Artificial Intelligence 102 (1998) 143-155
56. Khachian L.G. A polynomial time algorithm for linear programming. Soviet Math. Dokl. 20 (1979) 191-194
57. Khanna S., Sudan M., Trevisan L., and Williamson D. The approximability of constraint satisfaction problems. SIAM Journal on Computing 30 6 (2001) 1863-1920
58. Kirousis L. Fast parallel constraint satisfaction. Artificial Intelligence 64 (1993) 147-160
59. Kolaitis Ph.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61 (2000) 302-332
60. Koubarakis M. Dense time and temporal constraints with ≠. In: Nebel B., Rich C., and Swartout W. (Eds). Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92) (1992), Morgan Kaufmann, San Mateo, CA 24-35
61. Koubarakis M. From local to global consistency in temporal constraint networks. Proceedings 1st International Conference on Constraint Programming-CP'95 (Cassis, France, September 1995). Lecture Notes in Computer Science volume 976 (1995), Springer-Verlag 53-69
62. Koubarakis M. Tractable disjunctions of linear constraints. Proceedings 2nd International Conference on Constraint Programming-CP'96. Lecture Notes in Computer Science volume 1118 (1996), Springer-Verlag 297-307
63. Krokhin A., Bulatov A., and Jeavons P. Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. Proceedings 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003) (2003), IEEE Computer Society 343-351
64. Krokhin A., Jeavons P., and Jonsson P. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. Journal of the ACM 50 (2003) 591-640
65. Krokhin A., Jeavons P., and Jonsson P. Constraint satisfaction problems on intervals and lengths. SIAM Journal on Discrete Mathematics 17 (2004) 453-477
66. Ladkin P.B., and Maddux R.D. On binary constraint problems. Journal of the ACM 41 (1994) 435-469
67. Ladner R.E. On the structure of polynomial time reducibility. Journal of the ACM 22 (1975) 155-171
68. Lassez J.-L., and McAloon K. A constraint sequent calculus. Constraint Logic Programming, Selected Research (1991), MIT Press 33-43
69. Lassez J.-L., and McAloon K. A canonical form for generalized linear constraints. Journal of Symbolic Computation 13 (1992) 1-24
70. Lesaint D., Azarmi N., Laithwaite R., and Walker P. Engineering dynamic scheduler for Work Manager. BT Technology Journal 16 (1998) 16-29
71. KAM-DIMATIA Series. Łuczak T., and Nešetřil J. A probabilistic approach to the dichotomy problem. Technical Report 2003-640 (2003), Charles University
72. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
73. Mackworth A.K. Constraint satisfaction. In: Shapiro S.C. (Ed). Encyclopedia of Artificial Intelligence volume 1 (1992), Wiley Interscience, Prague 285-293
74. Mackworth A.K., and Freuder E.C. The complexity of constraint satisfaction revisited. Artificial Intelligence 59 (1993) 57-62
75. McKenzie R.N., McNulty G.F., and Taylor W.F. Algebras, Lattices and Varieties volume I (1987), Wadsworth and Brooks
76. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95-132
77. Nebel B., and Bürckert H.-J. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM 42 (1995) 43-66
78. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley, California
79. July. Pearson J.K., and Jeavons P.G. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15 (1997), Royal Holloway, University of London
80. Pippenger N. Theories of Computability (1997), Cambridge University Press
81. Pöschel R., and Kalužnin L.A. Funktionen- und Relationenalgebren (1979), DVW, Cambridge
82. Post E.L. The two-valued iterative systems of mathematical logic. Annals Mathematical Studies volume 5 (1941), Princeton University Press, Berlin
83. Purvis L., and Jeavons P. Constraint tractability theory and its application to the product development process for a constraint-based scheduler. Proceedings of 1st International Conference on The Practical Application of Constrain Technologies and Logic Programming - PACLP'99 (1999), Practical Applications Company 63-79
84. Renz J., and Nebel B. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108 (1999) 69-123
85. North-Holland. Rosenberg I.G. Minimal clones I: the five types. Lectures in Universal Algebra (Proc. Conf. Szeged 1983). Colloq. Math. Soc. Janos Bolyai volume 43 (1986) 405-427
86. Schaefer T.J. The complexity of satisfiability problem. Proceedings 10th ACM Symposium on Theory of Computing, STOC'78 (1978) 216-226
87. Schwalb E., and Vila L. Temporal constraints: a survey. Constraints 3 2-3 (1998) 129-149
88. Szendrei A. Clones in Universal Algebra. Seminaires de Mathematiques Superieures volume 99 (1986), University of Montreal
89. van Beek P., and Dechter R. On the minimality and decomposability of row-convex constraint networks. Journal of the ACM 42 (1995) 543-561
90. van Beek P., and Dechter R. Constraint tightness and looseness versus local and global consistency. Journal of the ACM 44 (1997) 549-566
91. van Hentenryck P., Deville Y., and Teng C.-M. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992) 291-321
92. Vilain M., Kautz H., and van Beek P. Constraint propagation algorithms for temporal reasoning: A revised report. In: Weld D.S., and de Kleer J. (Eds). Readings in Qualitative Reasoning about Physical Systems (1989), Morgan Kaufmann 373-381