On the inherent level of local consistency in constraint networks
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improving repair-based constraint satisfaction methods by value propagation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
New Search Heuristics for Max-CSP
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Models for the Covering Test Problem
Constraints
A new look at the easy-hard-easy pattern of combinatorial search difficulty
Journal of Artificial Intelligence Research
When gravity fails: local search topology
Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
Hidden gold in random generation of SAT satisfiable instances
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Systematic versus stochastic constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A graph-based method for improving GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Constraint-Based approaches to the covering test problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Hi-index | 0.00 |
It has been shown that hill-climbing constraint satisfaction methods like min-conflicts [Minton et al., 1990] and GSAT [Selman et al., 1992] can outperform complete systematic search methods like backtracking and backjumping on many large classes of problems. In this paper we investigate how preprocessing improves GSAT. In particular, we will focus on the effect of enforcing local consistency on the performance of GSAT. We will show that enforcing local consistency on uniform random problems has very little effect on the performance of GSAT. However, when the problem has hierarchical structure, local consistency can significantly improve GSAT. It has been shown [Konolige, 1994] that there are certain structured problems that are very hard for GSAT while being very easy for the Davis-Putnam procedure. We will show that they become very easy for GSAT once a certain level of local consistency is enforced.