Phase transitions in artificial intelligence systems
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Models for iterative global optimization
Models for iterative global optimization
A machine program for theorem-proving
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constraint Processing
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th 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
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
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines
Journal of Artificial Intelligence Research
A novel local search algorithm for the traveling salesman problem that exploits backbones
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Learning the large-scale structure of the MAX-SAT landscape using populations
IEEE Transactions on Evolutionary Computation
Effective variable fixing and scoring strategies for binary quadratic programming
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
An empirical evaluation of o(1) steepest descent for NK-Landscapes
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Backbone guided tabu search for solving the UBQP problem
Journal of Heuristics
Hi-index | 0.00 |
Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are difficult combinatorial problems that have many important real-world applications. In this paper, we first investigate the configuration landscapes of local minima reached by the WalkSAT local search algorithm, one of the most effective algorithms for SAT. A configuration landscape of a set of local minima is their distribution in terms of quality and structural differences relative to an optimal or a reference solution. Our experimental results show that local minima from WalkSAT form large clusters, and their configuration landscapes constitute big valleys, in that high quality local minima typically share large partial structures with optimal solutions. Inspired by this insight into WalkSAT and the previous research on phase transitions and backbones of combinatorial problems, we propose and develop a novel method that exploits the configuration landscapes of such local minima. The new method, termed as backbone-guided search, can be embedded in a local search algorithm, such as WalkSAT, to improve its performance. Our experimental results show that backbone-guided local search is effective on overconstrained random Max-SAT instances. Moreover, on large problem instances from a SAT library (SATLIB), the backbone guided WalkSAT algorithm finds satisfiable solutions more often than WalkSAT on SAT problem instances, and obtains better solutions than WalkSAT on Max-SAT problem instances, improving solution quality by 20% on average.