Skip to main content
SpringerLink
Log in

A Glimpse of Constraint Satisfaction

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Constraint satisfaction has become an important field in computer science. This technology is embedded in millions of pounds of software used by major companies. Many researchers or software engineers in the industry could have benefited from using constraint technology without realizing it. The aim of this paper is to promote constraint technology by providing readers with a fairly quick introduction to this field. The approach here is to use the well known 8-queens problem to illustrate the basic techniques in constraint satisfaction (without going into great details), and leave interested readers with pointers to further study this field.

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

Access this article

Log in via an institution

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

  • Aarts, E. & Korst, J. (1989). Simulated Annealing and Boltzmann Machines. John Wiley & Sons.

  • Borrett, J. (1998). Formulation Selection for Constraint Satisfaction Problems: A Heuristic Approach, PhD Thesis, Department of Computer Science, University of Essex, Colchester, UK.

    Google Scholar 

  • Chew, T-L., David, J-M., Nguyen, A. & Tourbier, Y. (1992). Sovling Constraint Satisfaction Problems with Simulated Annealing: The Car Sequencing Problem Revisited, Proceedings, International Workshop on Expert Systems and Their Applications, 405-416. France: Avignon.

  • Colmerauer, A. (July 1990). An introduction to Prolog III. CACM 33(7): 69-90.

    Google Scholar 

  • Constraints Archives: http://www.cirl.uoregon.edu/constraints/ and http://www.cs.unh.edu/ccc/archive.

  • Cras, J-Y. (1993). A Review of Industrial Constraint Solving Tools, AI Perspective Series. AI Intelligence: Oxford, UK.

    Google Scholar 

  • Davenport, A., Tsang, E. P. K., Wang, C. J. & Zhu, K. (1994). GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. Proc., 12th National Conference for Artificial Intelligence (AAAI), 325-330.

  • Dechter, R. & Pearl, J. (1988). Network-Based Heuristics for Constraint-Satisfaction Problems. Artifical Intelligence 34: 1-38.

    Google Scholar 

  • Eiben, A. E., Raue, P-E. & Ruttkay, Zs. (1994). Solving Constraint Satisfaction Problems Using Genetic Algorithms. Proc., IEEE World Confernece on Computational Intelligence, 1st IEEE Conference on Evolutionary Computation, 543-547.

  • Freuder, E. C. & Mackworth, A. (ed.) (1994). Constraint-Based Reasoning. MIT Press.

  • Freuder, E. C., Dechter, R., Ginsberg, M., Selman, B. & Tsang, E. (August 1995). Systematic Versus Stochastic Constraint Satisfaction. Panel Paper. In Mellish, C. (ed.) Proc., 14th International Joint Conference on AI, 2027-2032. Canada: Montreal.

  • Gent, I. P. & Walsh, T. (1993). An Empirical Analysis of Search in GSAT. Journal of Artificial Intelligence Research 1: 47-59.

    Google Scholar 

  • Glover, F. (1989). Tabu Search Part 1. Operations Research Society of America (ORSA) Journal on Computing 1: 109-206.

    Google Scholar 

  • Glover, F. & Laguna, M. (1993). Tabu Search. In Reeves, C. (ed.) Modern Heuristic Techniques for Combinational Problems, 71-141. Blackwell Scientific Publishing.

  • Grant, S. A. (1998). Phase Transition Behavior in Constraint Satisfaction Problems. PhD Thesis, School of Computer Studies, University of Leeds, UK.

    Google Scholar 

  • Haralick, R. M. & Elliott, G. L. (1980). Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14: 263-313.

    Google Scholar 

  • Lau, T. L. & Tsang, E. P. K. (December 1997). Solving the Processor Configuration Problem with a Mutation-Based Genetic Algorithm. International Journal on Artificial Intelligence Tools (IJAIT), World Scientific 6(4): 567-585.

    Google Scholar 

  • Lever, J., Wallace, M. & Richards, B. (1995). Constraint Logic Programming for Scheduling and Planning. Britisch Telecom Technology Journal 13(1): 73-80. Ipswich: Martlesham Heath.

    Google Scholar 

  • Mackworth, A. K. (1977). Consistency in Networks of Relations. Artificial Intelligence 8(1): 99-118.

    Google Scholar 

  • Minton, S., Jonston, M., Philips, A. B. & Laird, P. (1992). Minizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58(1–3) (Special Volume on Constraint Based Reasoning): 161-205.

    Google Scholar 

  • Nadel, B. A. (1990). Representation Selection for Constraint Satisfaction: A Case Study Using N-Queens, IEEE Expert 5: 16-23.

    Google Scholar 

  • Prosser, P. (1993). Hybrid Algorithms for the Constraint Satisfaction Problem. Coputational Intelligence 9(3): 268-299.

    Google Scholar 

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

    Google Scholar 

  • Reeves, C. R. (ed.). (1993). Modern Heuristic Techniques for Combinational Problems. Blackwell Scientific Publishing.

  • Rich, E. & Knight, K. (1991). Artifical Intelligence (2nd edn.), 88-94. McGraw Hill, Inc.

  • Richards, T., Jiang, Y. & Richards, B. (1995). Ng-Backmarking — an Algorithm for Constraint Satisfaction. British Telcom Technology Journal 13(1): 102-109. Ipswich, UK: Martlesham Heath.

    Google Scholar 

  • Ruttkay, Zs., Eiben, A. E. & Raue, P. E. (1995). Improving the Performances of GAs on a GA-hard CSP. Proceedings, CP95 Workshop on Studying and Solving Really Hard Problems, 157-171.

  • Selman, B. & Kautz, H. (1993). Domain-Independent Extenssions to GSAT: Solving Large Structured Satisfiability Problems. Proc., 13th International Joint Conference on AI, 290-295.

  • Selman, B., Kautz, H. A. & Cohen, B. (1994). Noise Strategies for Improving Local Search. Proc., 12th National Conference for Artificial Intellignece (AAAI), 337-343.

  • Simonis, H. (1995). The CHIP System and Its Applications. In Montanari, U. & Rossi, F. (ed.) Proceedings, Principles and Practice of Constraint Programming (CP'95), Lecture Notes in Computer Science. Springer Verlag: Berlin/Heidelberg/New York, 643-646.

    Google Scholar 

  • Tsang, E. P. K. (1993). Foundations of Constraint Satisfaction. Academic Press: London and San Diego (see http://scwww.essex.au.uk/CSP/edward/FCS/html for availability).

    Google Scholar 

  • Tsang, E. P. K., Borrett, J. E. & Kwan, A. C. M. (April, 1995). An Attempt to Map the Performance of a Range of Algorithm and Heuristic Combinations. Proceedings, Artificial Intelligence and Simulated Behavior Conference, 203-216.

  • Tsang, E. P. K. & Voudouris, C. (March, 1997). Fast Local Search and Quided Local Search and Their Application to British Telecom's Workforce Scheduling Problem. Operations Research Letters 20(3): 119-127. Amsterdam: Elsevier Science Publishers.

    Google Scholar 

  • Voudouris, C. & Tsang, E. P. K. (1996). Partial Constraint Satisfaction Problems and Guided Local Search. Proc., Practical Application of Constraint Technology (PACT'96), London, 337-356.

  • Voudouris, C. & Tsang, E. P. K. (November 1998). Guided Local Search and Its Application to the Traveling Salesman Problem. European Journal of Operational Research 113(2): 80-110.

    Google Scholar 

  • Warwick, T. & Tsang, E. P. K. (1995). Tackling Car Sequencing Problems Using a Generic Genetic Algorithm. Evolutionary Computation 3(3): 267-298.

    Google Scholar 

  • Zweben, M. & Fox, M. S. (ed.) (1949). Intelligent Scheduling. San Francisco: Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Essex, Colchester, Essex, CO4 3SQ, UK

    Edward Tsang

Authors
  1. Edward Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsang, E. A Glimpse of Constraint Satisfaction. Artificial Intelligence Review 13, 215–227 (1999). https://doi.org/10.1023/A:1006558104682

Download citation

  • Issue Date:

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

Search

Navigation