Abstract
Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparently minor simplification can in fact change the complexity of the problem, and hence mask the existence of certain tractable constraint types. In this paper we describe a new algebraic framework which allows us to deal more precisely with problems where different variables may have different domains. Using this new framework we are able to identify new tractable classes of constraints, by combining algorithms devised for the simplified, single domain, problem. We also systematically develop an algebraic structural theory for the general problem, and show that this theory can be used to generalise earlier results about the complexity of certain constraint types.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, Canada, November 2002, pp. 649–658 (2002)
Bulatov, A.A.: Mal’tsev constraints are tractable. Technical Report PRG-RR-02- 05, Computing Laboratory, University of Oxford, Oxford, UK (2002)
Bulatov, A.A., Jeavons, P.G.: Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK (2000)
Bulatov, A.A., Jeavons, P.G.: An algebraic approach to multi-sorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK (2001)
Bulatov, A.A., Jeavons, P.G., Krokhin, A.A.: The complexity of maximal constraint languages. In: Proceedings of the 33rd Annual ACM Simposium on Theory of Computing, Hersonissos, Crete, Greece, pp. 667–674. ACM Press, New York (2001)
Bulatov, A.A., Krokhin, A.A., Jeavons, P.G.: Constraint satisfaction problems and finite algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 272–282. Springer, Heidelberg (2000)
Cohen, D.A., Jeavons, P.G., Jonsson, P., Koubarakis, M.: Building tractable disjunctive constraints. Journal of the ACM 47, 826–853 (2000)
Cooper, M.C.: An optimal k-consistency algorithm. Art. Intell. 41, 89–95 (1989)
Cooper, M.C., Cohen, D.A., Jeavons, P.G.: Characterising tractable constraints. Artificial Intelligence 65, 347–361 (1994)
Dalmau, V.: A new tractable class of constraint satisfaction problems. In: Proc. 6th International Symposium on Artificial Intelligence and Mathematics (2000)
Dalmau, V., Pearson, J.: Set functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159–173. Springer, Heidelberg (1999)
Feder, T.: Classification of homomorphisms to oriented cycles and of k-partite satisfiability. SIAM J. of Discrete Math. 14(4), 471–480 (2001)
Feder, T., Vardi, M.Y.: 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)
Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Gault, R.: Polyanna Technical Manual (version 1.00). Technical Report PRG-RR- 01-20, Computing Laboratory, University of Oxford, Oxford, UK (2001)
Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics. vol. 76. American Mathematical Society, Providence (1988)
Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoretical. Computer Science 200, 185–204 (1998)
Jeavons, P.G., Cohen, D.A., Cooper, M.C.: Constraints, consistency and closure. Artificial Intelligence 101(1-2), 251–265 (1998)
Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527–548 (1997)
Kirousis, L.: Fast parallel constraint satisfaction. Artificial Intelligence 64, 147–160 (1993)
Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 302–332 (2000)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)
McKenzie, R.N., McNulty, G.F., Taylor, W.F.: Algebras, Lattices and Varieties, vol. I. Wadsworth and Brooks, California (1987)
Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7, 95–132 (1974)
Pöschel, R., Kalužnin, L.A.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216–226 (1978)
van Beek, P., Dechter, R.: On the minimality and decomposability of row-convex constraint networks. Journal of the ACM 42, 543–561 (1995)
van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)
Vardi, M.Y.: Constraint satisfaction and database theory: a tutorial. In: Proceedings of 19th ACM Symposium on Priciples of Database Systems (PODS 2000) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bulatov, A.A., Jeavons, P. (2003). An Algebraic Approach to Multi-sorted Constraints. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive