A unifying framework for tractable constraints

  • Peter Jeavons
  • David Cohen
  • Marc Gyssens
Constraint Satisfaction Problems 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 976)


Many combinatorial search problems may be expressed as constraint satisfaction problems, and this class of problems is known to be NP-complete in general. In this paper we examine restricted classes of constraints which lead to tractable problems. We show that all known classes with this property may be characterized by a simple algebraic closure condition. Using this condition provides a uniform test to establish whether a given set of constraints falls into any of the known tractable classes, and may therefore be solved efficiently.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Codd, E.F., “A Relational Model of Data for Large Shared Databanks,” Communications of the ACM 13 (1970), pp. 377–387.CrossRefGoogle Scholar
  2. 2.
    Cooper, M.C., Cohen, D.A., Jeavons, P.G., “Characterizing tractable constraints,” Artificial Intelligence 65 (1994), pp. 347–361.CrossRefGoogle Scholar
  3. 3.
    Cooper, M.C., & Jeavons, P.G., “Tractable constraints on ordered domains,” Technical Report, Dept of Computer Science, Royal Holloway, University of London (1994) and submitted to Artificial Intelligence.Google Scholar
  4. 4.
    Davey B.A. & Priestley, H.A., Introduction to Lattices and Order, Cambridge University Press (1990).Google Scholar
  5. 5.
    Dechter, R., & Pearl, J., “Structure identification in relational data,” Artificial Intelligence 58 (1992), pp. 237–270.CrossRefGoogle Scholar
  6. 6.
    Dechter, R. & Pearl J. “Network-based heuristics for constraint-satisfaction problems,” Artificial Intelligence 34 (1988), pp. 1–38.CrossRefGoogle Scholar
  7. 7.
    Freuder, E.C., “A sufficient condition for backtrack-bounded search,” Journal of the ACM 32 (1985), pp. 755–761.CrossRefGoogle Scholar
  8. 8.
    Gyssens, M., Jeavons, P., Cohen, D., “Decomposing constraint satisfaction problems using database techniques,” Artificial Intelligence 66 (1994), pp. 57–89.CrossRefGoogle Scholar
  9. 9.
    Jeavons, P.G., “An algebraic characterization of tractable constraints,” Technical Report CSD-TR-95-05, Royal Holloway, University of London (1995).Google Scholar
  10. 10.
    Kirousis, L., “Fast parallel constraint satisfaction,” Artificial Intelligence 64 (1993), pp. 147–160.CrossRefGoogle Scholar
  11. 11.
    Ladkin, P.B., & Maddux, R.D., “On binary constraint problems,” Journal of the ACM 41 (1994), pp. 435–469.CrossRefGoogle Scholar
  12. 12.
    Mackworth, A.K. “Consistency in networks of relations,” Artificial Intelligence 8 (1977), pp. 99–118.CrossRefGoogle Scholar
  13. 13.
    Montanari, U., “Networks of constraints: fundamental properties and applications to picture processing,” Information Sciences 7 (1974), pp. 95–132.CrossRefGoogle Scholar
  14. 14.
    Montanari, U., & Rossi, F., “Constraint relaxation may be perfect,” Artificial Intelligence 48 (1991), pp. 143–170.CrossRefGoogle Scholar
  15. 15.
    Papadimitriou, C.H., Computational Complexity, Addison-Wesley (1994).Google Scholar
  16. 16.
    Schaefer, T.J., “The complexity of satisfiability problems,” Proc 10th ACM Symposium on Theory of Computing (STOC) (1978), pp. 216–226.Google Scholar
  17. 17.
    Szendrei, A., Clones in Universal Algebra, Séminaires de Mathématiques Supérieures 99, Université de Montréal (1986).Google Scholar
  18. 18.
    van Beek, P., “On the Minimality and Decomposability of Row-Convex Constraint Networks,” Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI-9S, MIT Press (1992), pp. 447–452.Google Scholar
  19. 19.
    Van Hentenryck, P., Deville, Y., Teng, C-M., “A generic arc-consistency algorithm and its specializations,” Artificial Intelligence 57 (1992), pp. 291–321.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Peter Jeavons
    • 1
  • David Cohen
    • 1
  • Marc Gyssens
    • 2
  1. 1.Department of Computer ScienceUniversity of LondonRoyal HollowayUK
  2. 2.Department WNIUniversity of LimburgDiepenbeekBelgium

Personalised recommendations