IJCAI
2007
13 years 5 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Shaving algorithms, like singleton arc consistency (sac), are currently receiving much interest. They remove values which are not part of any solution. This paper proposes an effic...
CP
2000
Springer
13 years 8 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
CP
2001
Springer
13 years 8 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
CP
2003
Springer
13 years 9 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
2005
Springer
13 years 9 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
SAC
2005
ACM
13 years 9 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...