An algebraic approach to multi-sorted constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 183-198

  Bulatov, Andrei A ^a   Jeavons, Peter ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ALGEBRAIC APPROACHES; ALGEBRAIC FRAMEWORK; CONSTRAINT TYPES; DIFFERENT DOMAINS; SINGLE DOMAINS; STRUCTURAL THEORIES; THEORETICAL STUDY; TRACTABLE CLASS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248812866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_13     Document Type: Article

References (29)

1. A.A. Bulatov. 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, Vancouver, Canada, November 2002.
2. A.A. Bulatov. Mal'tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
3. A.A. Bulatov and P.G. Jeavons. Tractable constraints closed under a binary operation, Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK, 2000.
4. A.A. Bulatov and P.G. Jeavons. An algebraic approach to multi-sorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK, 2001.
5. A.A. Bulatov, P.G. Jeavons, and A.A. Krokhin. 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.
6. A.A. Bulatov, A.A. Krokhin, and P.G. 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.
7. D.A. Cohen, P.G. Jeavons, P. Jonsson, and M. Koubarakis. Building tractable disjunctive constraints. Journal of the ACM, 47:826-853, 2000.
8. M.C. Cooper. An optimal k-consistency algorithm. Art. Intell., 41:89-95, 1989.
9. M.C. Cooper, D.A. Cohen, and P.G. Jeavons. Characterising tractable constraints. Artificial Intelligence, 65:347-361, 1994.
10. V. Dalmau. A new tractable class of constraint satisfaction problems. In Proc. 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
11. V. Dalmau and J. Pearson. Set functions and width 1 problems. In Proceedings 5th International Conference on Constraint Programming, CP'99, volume 1713 of Lecture Notes in Computer Science, pages 159-173. Springer-Verlag, 1999.
12. T. Feder. Classification of homomorphisms to oriented cycles and of k-partite satisfiability. SIAM J. of Discrete Math., 14(4):471-480, 2001.
13. T. Feder and 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:57-104, 1998.
14. M. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA., 1979.
15. R. Gault. Polyanna Technical Manual (version 1.00). Technical Report PRG-RR-01-20, Computing Laboratory, University of Oxford, Oxford, UK, 2001.
16. D. Hobby and R.N. McKenzie. The Structure of Finite Algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, 1988.
17. P.G. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
18. P.G. Jeavons, D.A. Cohen, and M.C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-265, 1998.
19. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
20. L. Kirousis. Fast parallel constraint satisfaction. Artificial Intelligence, 64:147-160, 1993.
21. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61:302-332, 2000.
22. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
23. R.N. McKenzie, G.F. McNulty, and W.F. Taylor. Algebras, Lattices and Varieties, volume I. 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. R. Pöschel and L.A. Kalužnin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
26. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing (STOC'78), pages 216-226, 1978.
27. P. van Beek and R. Dechter. On the minimality and decomposability of row-convex constraint networks. Journal of the ACM, 42:543-561, 1995.
28. P. van Hentenryck, Y. Deville, and C-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321, 1992.
29. M.Y. Vardi. Constraint satisfaction and database theory: a tutorial. In Proceedings of 19th ACM Symposium on Priciples of Database Systems (PODS'00), 2000.