Using finite domains in constraint satisfaction problem

  • Authors:

  • Ilie Popescu

  • Affiliations:

  • Computer Science Department, University of Quebec in Outaouois, Gatineau, Québec, Canada

  • Venue:
  • Intelligent information processing II
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 are 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.