CP
2003
Springer
13 years 10 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
CP
2003
Springer
13 years 10 months ago
2003
Springer
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Constraint programming offers powerful problem solving capabilities, but experienced and skilled developers are needed to maximise the benefits it offers. We introduce...
CP
2003
Springer
13 years 10 months ago
2003
Springer
CP
2003
Springer
13 years 10 months ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
CP
2003
Springer
13 years 10 months ago
2003
Springer
CP
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
CP
2003
Springer
13 years 10 months ago
2003
Springer