Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Local Search Characteristics of Incomplete SAT Procedures
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Performance test of local search algorithms using new types of random CNF formulas
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Adding new clauses for faster local search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Weighting for godot: learning heuristics for GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
A mixture-model for the behaviour of SLS algorithms for SAT
Eighteenth national conference on Artificial intelligence
Measuring mobility and the performance of global search algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Journal of Artificial Intelligence Research
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
Generating SAT local-search heuristics using a GP hyper-heuristic framework
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Journal of Automated Reasoning
Neighborhood analysis: a case study on curriculum-based course timetabling
Journal of Heuristics
A comparison of evolutionary methods for the discovery of local search heuristics
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Constraint metrics for local search
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Multi-agent collaborative service and distributed problem solving
Cognitive Systems Research
Toward understanding the optimization of complex systems
Artificial Intelligence Review
International Journal of Advanced Intelligence Paradigms
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Effective local search methods for finding satisfying assignments of CNF formulae exhibit several systematic characteristics in their search. We identify a series of measurable characteristics of local search behavior that are predictive of problem solving efficiency. These measures are shown to be useful for diagnosing inefficiencies in given search procedures, tuning parameters, and predicting the value of innovations to existing strategies. We then introduce a new local search method, SDF ("smoothed descent and flood"), that builds upon the intuitions gained by our study. SDF works by greedily descending in an informative objective (that considers how strongly clauses are satisfied, in addition to counting the number of unsatisfied clauses) and, once trapped in a local minima, "floods" this minima by re-weighting unsatisfied clauses to create a new descent direction. The resulting procedure exhibits superior local search characteristics under our measures. We show that this method can compete with the state of the art techniques, and significantly reduces the number of search steps relative to many recent methods. Copyright 2001 Elsevier Science B.V.