On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An empirical analysis of search in GSAT
Journal of Artificial Intelligence Research
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
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving the Satisfiability Problem through Boolean Networks
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
The Knowledge Engineering Review
Analyzing the Performance of Generalized Hill Climbing Algorithms
Journal of Heuristics
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Discrete Applied Mathematics
Automated discovery of local search heuristics for satisfiability testing
Evolutionary Computation
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Justification-Based Local Search with Adaptive Noise Strategies
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Complete local search for propositional satisfiability
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
MAX-2-SAT: how good is Tabu search in the worst-case?
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Local-search techniques for boolean combinations of pseudo-boolean constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SAT-based versus CSP-based constraint weighting for satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Massively parallel evolution of SAT heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Iterated robust tabu search for MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Scaling and probabilistic smoothing: dynamic local search for unweighted MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Combining adaptive noise and look-ahead in local search for SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Weight redistribution for unweighted MAX-SAT
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Speeding-up non-clausal local search for propositional satisfiability with clause learning
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Generating meta-heuristic optimization code using ADATE
Journal of Heuristics
Local search for stable marriage problems with ties and incomplete lists
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
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
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Depth-driven circuit-level stochastic local search for SAT
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Multi-agent collaborative service and distributed problem solving
Cognitive Systems Research
Metaheuristic approaches to tool selection optimisation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Exploiting historical relationships of clauses and variables in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Journal of Global Optimization
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT
Journal of Heuristics
| Hi-index | 0.00 |
Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT) have been successfully applied to solve suitably encoded search problems from various domains. One drawback of these algorithms is that they are usually incomplete. We refine the notion of incompleteness for stochastic decision algorithms by introducing the notion of "probabilistic asymptotic completeness" (PAC) and prove for a number of well-known SLS algorithms whether or not they have this property. We also give evidence for the practical impact of the PAC property and show how to achieve the PAC property and significantly improved performance in practice for some of the most powerful SLS algorithms for SAT, using a simple and general technique called "random walk extension".