Skip to main content
Log in

A Context for Constraint Satisfaction Problem Formulation Selection

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Much research effort has been applied to finding effective ways for solving constraint satisfaction problems. However, the most fundamental aspect of constraint satisfaction problem solving, problem formulation, has received much less attention. This is important because the selection of an appropriate formulation can have dramatic effects on the efficiency of any constraint satisfaction problem solving algorithm.

In this paper, we address the issue of problem formulation. We identify the heuristic nature of generating a good formulation and we propose a context for this process. Our work presents the research community with a focus for the many elements which affect problem formulation and this is illustrated with the example adding redundant constraints. It also provides a significant step towards the goal of automatic selection of problem formulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amarel, S. (1968). On representation of problems of reasoning about actions. Machine Intelligence, 3: 131–171.

    Google Scholar 

  • Borrett, J. E. (1998). Formulation selection for constraint satisfaction problems: A heuristic approach. PhD thesis, Dept. of Computer Science, University of Essex, UK.

    Google Scholar 

  • Borrett, J. E., Tsang, E. P. K., & Walsh, N. R. (1996). Adaptive constraint satisfaction: The quickest first principle. In Proceedings of the 12th European Conference on Artificial Intelligence, pages 160–164.

  • Chamard, A., Fischler, A., Guinaudeau, D.–B., & Guillard A. (1995). CHIC lessons on CLP methodology; ECRC report.

  • Dechter, A., & Dechter, R. (1987). Removing redundancies in constraint nerworks, In Proceedings of the National Conference on Artificial Intelligence, pages 105–109.

  • Dechter, R., & Pearl, J. (1988). Network–based heuristics for constraint–satisfaction problems. Artificial Intelligence, 34: 1–38.

    Google Scholar 

  • Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38: 353–366.

    Google Scholar 

  • Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 693–702.

  • Freuder, E. (1982). A sufficient condition for backtrack–free search. Journal of ACM, 29(1): 24–32.

    Google Scholar 

  • Freuder, E. C., & Sabin, D. (1997). Interchangeability supports abstraction and reformulation for multidimensional constraint satisfaction. In Proceedings of the 14th National Conference on Artificial Intelligence.

  • Freuder, E. C., Wallace, J., & Sabin, D. (1995). Generalisation and abstraction for constraint satisfaction. In Proceedings of the Constraint–95, and International Workshop on Constraint–Based Reasoning, pages 16–24.

  • Freuder, E. C. (1999). Modeling: The final frontier. In The First International Conference on The Practical Application of Constraint Technologies and Logic Programming (PACLP), London, pages 15–21.

  • Gaschnig, J. (1979). Performance measurement and analysis of certain search algorithms. CMU–CS–79–124 Technical Report, Carnegie–Mellon University, Pittsburg.

    Google Scholar 

  • Gent, I.P., & Prosser, P. (1994). Easy problems are sometimes hard, Research note. Artificial Intelligence 70: 335–345.

    Google Scholar 

  • Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263–313.

    Google Scholar 

  • Hogg, T., & Williams, C. P. (1994). The hardest constraint problems: A double phase transition, Research note. Artificial Intelligence, 69: 359–377.

    Google Scholar 

  • Korf, R. E. (1980). Toward a model of representation charges. Artificial Intelligence 14: 41–78.

    Google Scholar 

  • Kwan, A. C. M. (1997). A framework for mapping constraint satisfaction problems to solution methods. PhD thesis, Dept. of Computer Science, University of Essex, UK.

    Google Scholar 

  • Lever, J., Wallace, M., & Richards, B. (1995). Constraint logic programming for scheduling and planning, British Telecom Technology Journal, Ipswich, UK: Martlesham Heath 13(1): 73–80.

    Google Scholar 

  • Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence 8: 99–118.

    Google Scholar 

  • Nudel, B. A. (1982). Consistent–labelling problems and their algorithms. In proceedings of the National Conference on Artificial Intelligence, pages 128–132.

  • Nudel, B. A. (1983a). Consistent–labelling problems and their algorithms: Expected–complexities and theorybased heuristics. Artificial Intelligence, 21(1–2): 135–178.

    Google Scholar 

  • Nudel, B. A. (1983b). Solving the general consistent–labelling (or constraint satisfaction) problem: Two algorithm and their expected complexities. In proceedings of the National Conference on Artificial Intelligence, pages 292–296.

  • Nadel, B. A. (1990). Representation selection for constraint satisfaction: A case study using n–queens. IEEE Expert, 5: 16–23.

    Google Scholar 

  • Puget, J.–F. (1995). Applications of constraint programming. In Proceedings, Principles and Practice of Constraint Programming (CP'95), Lecture Notes in Computer Science, pages 647–650. U. Montanari and F. Rossi, eds. Berlin, Heidelberg and New York: Springer Verlag.

    Google Scholar 

  • Rossi, F., Petrie, C., & Dhar, V. (1990). On the equivalent of constraint satisfaction problems. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 550–557.

  • Simonis, H. (1995). The CHIP system and its applications, In Proceedings, Principles and Practice of Constraint programming (CP 95), Lecture Notes in Computer Science, pages 643–646. U. Montanari and F. Rossi, eds. Berlin, Heidelberg and New York: Springer Verlag.

    Google Scholar 

  • Smith, B. M. (1994). Phase transition and the mushy region in constraint satisfaction problems. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 100–104.

  • Smith, B. M., & Grant, S. A. (1995). Where the exceptionally hard problems are, Proceedings, Workshop on Studying and Solving Really Hard Problems. In First International Conference on Principles and Practice of Constraint Programming, September, pages 172–182.

  • Smith, B. M. (1996). Succeed–first or fail–first: A case study in variable and value ordering, Research Report 96.26, School of Computer Studies, University of Leeds, UK.

    Google Scholar 

  • Tsang, E. P. K. (1993). Foundations of Constraint Satisfaction. London: Academic Press.

    Google Scholar 

  • Tsang, E. P. K., Borrett, J. E., & Kwan, A. C. M. (1995). An attempt to map a range of constraint satisfaction algorithms and heuristics. In Proceedings of the 10th Biennial Conference on AI and Cognitive Science, Society for the Study of Artificial Intelligence and Simulation of Behaviour, pages 203–216.

  • Van Hentenryck, P. (1989). Constraint satisfaction in logic programming, Cambridge MA: MIT Press.

    Google Scholar 

  • Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58: 113–159.

    Google Scholar 

  • Wallace, M. (1996). Practical applications of constraint programming, Constraints, An International Journal, 1: 139–168.

    Google Scholar 

  • Zabih, R. Some applications of graph bandwidth to constraint satisfaction problems, In Proceedings of the National Conference for Artificial Intelligence (AAAI), 1990, pages 46–51.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borrett, J.E., Tsang, E.P.K. A Context for Constraint Satisfaction Problem Formulation Selection. Constraints 6, 299–327 (2001). https://doi.org/10.1023/A:1011432307724

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011432307724

Navigation