Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
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
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
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
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The exponentiated subgradient algorithm for heuristic Boolean programming
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
Clause Weighting Local Search for SAT
Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Automated discovery of local search heuristics for satisfiability testing
Evolutionary Computation
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence
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
Using Cost Distributions to Guide Weight Decay in Local Search for SAT
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Learning While Optimizing an Unknown Fitness Surface
Learning and Intelligent Optimization
Reinforcement Learning and Reactive Search: an adaptive MAX-SAT solver
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
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
Complete local search for propositional satisfiability
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Building structure into local search for SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Massively parallel evolution of SAT heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
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
Variable dependency in local search: prevention Is better than cure
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
Efficient combination of decision procedures for MUS computation
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Approximate model-based diagnosis using greedy stochastic search
Journal of Artificial Intelligence Research
Time-bounded sequential parameter optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Solving coarse-grained DisCSPs with local search
Web Intelligence and Agent Systems
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
Algorithm selection and scheduling
CP'11 Proceedings of the 17th 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
Adaptive clause weight redistribution
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Tie breaking in clause weighting local search for SAT
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
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
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
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
Longer-Term memory in clause weighting local search for SAT
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On the quality and quantity of random decisions in stochastic local search for SAT
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Multi-agent collaborative service and distributed problem solving
Cognitive Systems Research
Instance-Specific algorithm configuration as a method for non-model-based portfolio generation
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we study the approach of dynamic local search for the SAT problem. We focus on the recent and promising Exponentiated Sub-Gradient (ESG) algorithm, and examine the factors determining the time complexity of its search steps. Basedon the insights gained from our analysis, we developed Scaling and Probabilistic Smoothing (SAPS), an efficient SAT algorithm that is conceptually closely related to ESG. We also introduce a reactive version of SAPS (RSAPS) that adaptively tunes one of the algorithm's important parameters. We show that for a broadra nge of standard benchmark problems for SAT, SAPS andR SAPS achieve significantly better performance than both ESG and the state-of-the-art WalkSAT variant, Novelty+.