Characterizing tractable CSPs

  • Wanlin Pang
  • Scott D. Goodwin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1418)


In this paper, we introduce the notion of ω-graph as a representative graph for the hypergraph associated with general constraint satisfaction problems (CSPs) and define a new form of consistency called ω-consistency. We identify relationships between the structural property of the ω-graph and the level of ω-consistency that are sufficient to ensure tractability of general CSPs and we prove that the class of tractable CSPs identified here contains the class of tractable CSPs identified with some related conditions reported previously.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):497–513, 1983.CrossRefGoogle Scholar
  2. 2.
    C. Berge. Graphs and Hypergraphs. North-Holland, New York, 1973.Google Scholar
  3. 3.
    C. Bessiere and M. Cordier. Arc-consistency and arc-consistency again. In Proceedings of AAAI-93, pages 108–113, 1993.Google Scholar
  4. 4.
    M. Cooper. An optimal k-consistency algorithm. Artificial Intelligence, 41:89–95, 1989.CrossRefGoogle Scholar
  5. 5.
    R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1–38, 1988.CrossRefGoogle Scholar
  6. 6.
    R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353–366, 1989.CrossRefGoogle Scholar
  7. 7.
    R. Dechter and P. van Beek. Local and global relational consistency. In Proceedings of the 1st International Conference on Principles and Practices of Constraint Programming, pages 240–257, Cassis, France, September 1995.Google Scholar
  8. 8.
    E. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21(11):958–966, 1978.CrossRefGoogle Scholar
  9. 9.
    E. Freuder. A sufficient condition for backtrack-free search. J. of the ACM, 29(1):25–32, 1982.Google Scholar
  10. 10.
    M. Gyssens. On the complexity of join dependencies. ACM Transactions on Database Systems, 11(1):81–108, 1986.CrossRefGoogle Scholar
  11. 11.
    M. Gyssens, P. G. Jeavons, and uD. A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66:57–89, 1994.CrossRefGoogle Scholar
  12. 12.
    C. Han and C. Lee. Comments on Mohr and Henderson's path consistency algorithm. Artificial Intelligence, 36:125–130, 1988.CrossRefGoogle Scholar
  13. 13.
    P. Jeavons, D. Cohen, and M. Gyssens. A test for tractability. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP96), pages 267–281, Cambridge, MA, 1996.Google Scholar
  14. 14.
    P. Jegou. On the consistency of general constraint satisfaction problems. In Proceedings of AAAI-93, pages 114–119, 1993.Google Scholar
  15. 15.
    A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.CrossRefGoogle Scholar
  16. 16.
    R. Mohr and T. Henderson. Are and path consistency revisited. Artificial Intelligence, 28:225–233, 1986.CrossRefGoogle Scholar
  17. 17.
    U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 2:95–123, 1974.CrossRefGoogle Scholar
  18. 18.
    W. Pang. A Constraint-Directed Approach for Analyzing and Solving General Constraint Satisfaction Problems. PhD thesis, University of Regina, Canada, 1997.Google Scholar
  19. 19.
    W. Pang and S. D. Goodwin. A new synthesis algorithm for solving CSPs. In Proceedings of the 2nd International Workshop on Constraint-Based Reasoning, pages 1–10, Key West, FL, May 1996.Google Scholar
  20. 20.
    W. Pang and S. D. Goodwin. Constraint-directed backtracking. In The 10th Australian Joint Conference on AI, pages 47–56, Perth, Western Australia, December 1997.Google Scholar
  21. 21.
    E. Tsang. Foundations of Constraint Satisfaction. Academic Press, San Diego, CA, 1993.Google Scholar
  22. 22.
    P. van Beek. On the minimality and decomposability of constraint networks. In Proceedings of AAAI-92, pages 447–452, 1992.Google Scholar
  23. 23.
    P. Van Hentenryck, Y. Deville, and C. Teng. A generic arc-consistency algorithm and its specialization. Artificial Intelligence, 57:291–321, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Wanlin Pang
    • 1
  • Scott D. Goodwin
    • 2
  1. 1.Institute for Information TechnologyNational Research Council of CanadaOttawaCanada
  2. 2.Department of Computer ScienceUniversity of ReginaReginaCanada

Personalised recommendations