Sciweavers

Share
IJCAI
2007
8 years 9 months ago
Probabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
Deepak Mehta, Marc R. C. van Dongen
ECAI
2006
Springer
8 years 12 months ago
Beyond Singleton Arc Consistency
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...
Marc R. C. van Dongen
CP
2000
Springer
9 years 19 days ago
Maintaining Arc-Consistency within Dynamic Backtracking
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...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...
CP
2001
Springer
9 years 23 days ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
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...
Nikos Mamoulis, Kostas Stergiou
CP
2003
Springer
9 years 1 months ago
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
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 ...
Christophe Lecoutre, Frédéric Bousse...
CP
2005
Springer
9 years 1 months ago
Probabilistic Arc Consistency
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...
Deepak Mehta, Marc R. C. van Dongen
SAC
2005
ACM
9 years 1 months ago
Box-set consistency for interval-based constraint problems
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...
Gilles Chabert, Gilles Trombettoni, Bertrand Neveu
CP
2007
Springer
9 years 2 months ago
Path Consistency by Dual Consistency
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...
Christophe Lecoutre, Stéphane Cardon, Julie...
books