Implementing a test for tractability

Constraints

Volumn 9, Issue 2, 2004, Pages 139-160

  Gault, Richard ^a   Jeavons, Peter ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Complexity; Constraint language; Polyanna; Polymorphism; Symmetry

Indexed keywords

ALGEBRA; ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; PROBLEM SOLVING;

CONSTRAINT LANGUAGE; POLYANNA; POLYMORPHISM;

CONSTRAINT THEORY;

EID: 3543097486     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:CONS.0000024049.41091.71     Document Type: Article

References (34)

1. Bjäreland, M., & Jonsson, P. (1999). Exploiting bipartiteness to identify yet another tractable subclass of CSP. In Principles and Practice of Constraint Programming-CP'99, Vol. 1713 of Lecture Notes in Computer Science, Springer-Verlag, pages 118-128.
2. Bulatov, A. A. (2000). Tractable constraints closed under a binary operation. Technical Report TR-12-00, Oxford University, Computing Laboratory.
3. Bulatov, A. A. (2002). A dichotomy theorem for constraints on a three-element set. In Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS'02, pages 649-658.
4. Bulatov, A. A. (2002). Mal'tsev constraints are tractable. Technical Report RR-02-05, Oxford University, Computing Laboratory.
5. Bulatov, A. A. (2002). Tractable conservative constraint satisfaction problems. Technical Report RR-03-01, Oxford University, Computing Laboratory.
6. Bulatov, A. A., & Jeavons, P. G. (2001). Algebraic structures in combinatorial problems. Technical Report MATH-AL-4-2001, Technische Universität, Dresden.
7. Bulatov, A. A., Krokhin, A. A., & Jeavons, P. G. (2000). Constraint satisfaction problems and finite algebras. In Proceedings 27th International Colloquium on Automata, Languages and Programming, ICALP'00, Vol. 1853 of Lecture Notes in Computer Science, Springer-Verlag, pages 272-282.
8. Bulatov, A. A., Krokhin, A. A., & Jeavons, P. G. (2001). The complexity of maximal constraint languages. In Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01, pages 667-674.
9. Cohen, D. A., Jeavons, P. G., & Gault, R. L. (2000). New tractable constraint classes from old. In Principles and Practice of Constraint Programming-CP 2000, Vol. 1894 of Lecture Notes in Computer Science, Springer-Verlag, pages 160-171.
10. Cohn, P. M. (1965). Universal Algebra. Harper & Row.
11. Cooper, M. C., Cohen, D. A., & Jeavons, P. G. (1994). Characterising tractable constraints. Artificial Intelligence, 65: 347-361.
12. Dalmau, V. (2000). A new tractable class of constraint satisfaction problems. In Proceedings 6th International Symposium on Artificial Intelligence and Mathematics.
13. Dalmau, V., & Pearson, J. (1999). Set functions and width 1 problems. In Proceedings 5th International Conference on Constraint Programming, CP '99, Vol. 1713 of Lecture Notes in Computer Science, Springer-Verlag, pages 159-173.
14. Feder, T., & Vardi, M. Y. (1998). The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, Vol. 28: 57-104.
15. Garey, M., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman.
16. Gault, R. (2001). The Polyanna technical manual. Technical Report, RR-20-01, Oxford University, Computing Laboratory.
17. Hubbe, P. D., & Freuder, E. C. (1992). An efficient cross product representation of the constraint satisfaction problem search space. In Proceedings of the 10th National Conference on AI, AAAI, pages 421-427.
18. Jeavons, P. G. (1998). Constructing constraints. In Proceedings 4th International Conference on Constraint Programming CP'98 (Pisa. October 1998), Vol. 1520 of Lecture Notes in Computer Science, Springer-Verlag, pages 2-16.
19. Jeavons, P. G. (1998). On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200: 185-204.
20. Jeavons, P. G., Cohen, D. A., & Gyssens, M. (1995). A unifying framework for tractable constraints. In Proceedings 1st International Conference on Constraint Programming, CP '95, Vol. 976 of Lecture Notes in Computer Science, Springer-Verlag, pages 276-291.
21. Jeavons, P. G., Cohen, D. A., & Gyssens, M. (1996). A test for tractability. In Proceedings 2nd International Conference on Constraint Programming - CP'96 (Boston, August 1996), Vol. 1118 of Lecture Notes in Computer Science, Springer-Verlag, pages 267-281.
22. Jeavons, P. G., Cohen, D. A., & Gyssens, M. (1997). Closure properties of constraints. Journal of the ACM, 44: 527-548.
23. Jeavons, P. G., Cohen, D. A., & Gyssens, M. (1999). How to determine the expressive power of constraints. Constraints, 4: 113-131.
24. Jeavons, P. G., & Cooper, M. C. (1995). Tractable constraints on ordered domains. Artificial Intelligence, 79(2): 327-339.
25. Kirousis, L. (1993), Fast parallel constraint satisfaction. Artificial Intelligence, 64: 147-160.
26. Ladkin, P. B., & Maddux, R. D. (1994). On binary constraint problems. Journal of the ACM, 41: 435-469.
27. Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8: 99-118.
28. McKenzie, R. N., McNulty, G. F., & Taylor, W. F. (1987). Algebras, Lattices and Varieties, Vol. I. California, Wadsworth and Brooks.
29. Montanari, U. (1974). Networks of constraints; Fundamental properties and applications to picture processing. Information Sciences, 7: 95-132.
30. Nebel, B., & Bürckert, H.-J. (1995). Reasoning about temporal relations: a maximal tractable subclass of Alien's interval algebra. Journal of the ACM, 42: 43-66.
31. Pippenger, N. (1997). Theories of Computability. Cambridge: Cambridge University Press.
32. Pöschel, R., & Kalužnin, L. A. (1979). Funktionen- und Relationenalgebren. DVW, Berlin.
33. Schaefer, T. J. (1978). The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, pages 216-226.
34. van Beek, P., & Dechter, R. (1995). On the minimality and decomposability of row-convex constraint networks. Journal of the ACM, 42: 543-561.