Constraints Satisfaction Problems-CSPs Academic Article uri icon


  • Introductory texts on Constraints Satisfaction Problems (CSPs) can be found in [16, 58] and the basic papers are [15, 51]. A CSP is a well-known NP-complete problem [1 6], which is often used to represent and solve problems such as timetabling [41, 43], meeting scheduling [60] and a variety of other scheduling problems [12]. Formally, a CSP is a tuple< X, D, R>, where X is a finite set of variables X1, X2,..., Xm, and D is a set of domains D1, D2,..., Dm. Each domain Di contains a finite set of values which can be assigned to variable Xi. R is a …

publication date

  • January 1, 2008