Advertisement

Using Finite Domains in Constraint Satisfaction Problem

  • Ilie Popescu
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 163)

Abstract

Constraint satisfaction problem (CSP) methodologies are intended to solve (mostly combinatorial) problems especially in areas of planning and scheduling. Our paper focuses on a model enforcing arc consistency without changing the structure of the constraint network (CN), i.e., only by efficiently removing values from variable domains. The propagation of a variable domain to the constraints related to this variable allows the model to keep under control the size of the search space, by enumerating only the variable values which are part of a solution.

Key words

Constraint satisfaction problem consistency search space 

References

  1. 1.
    R. Bartak. On-line guide to Constraint Programming, Prague, 1998, http://kti.mff.cusni.ez/≈bartak/constraints/.Google Scholar
  2. 2.
    R. Debruyne, C. Bessière. Domains Filtering Consistencies. Journal of Artificial Intelligence Research 14, pages 205–230, 2001.MathSciNetGoogle Scholar
  3. 3.
    R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 276–284. John Wiley & Sons, 1992.Google Scholar
  4. 4.
    A.K. Mackworth. Constraint satisfaction. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 285–293. John Wiley & Sons, 1992.Google Scholar
  5. 5.
    J.J. McGregor. Relational consistency algorithms and their applications in finding sub graph and graph isomorphism, Information Science 19, pages 229–250, 1979.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    P. Meseguer. Constraint satisfaction problems: An overview. AICOM, 2, pages 3–17, 1989.Google Scholar
  7. 7.
    U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing, Information Science (7)(2), pages 95–132, 1974.zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    E. Tsang. Foundations of Constraint Satisfaction. London, Academic Press, 1993.Google Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Ilie Popescu
    • 1
  1. 1.Computer Science DepartmentUniversity of Quebec in OutaouaisGatineauCanada

Personalised recommendations