Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
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
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A continuous approach to inductive inference
Mathematical Programming: Series A and B
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Genetic Algorithms and Simulated Annealing
Genetic Algorithms and Simulated Annealing
Using Arc weights to improve iterative repair
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An integer local search method with application to capacitated production planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Phase Transitions and Stochastic Local Search in k-Term DNF Learning
ECML '02 Proceedings of the 13th European Conference on Machine Learning
On the Accuracy and Running Time of GSAT
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Computational and Structural Aspects of Openly Specified Type Hierarchies
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Towards Fewer Parameters for SAT Clause Weighting Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Proposal of a Quasi-Solution State Evolution Algorithm for Channel Assignment Problems
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
CP '02 Proceedings of the 8th 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
Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Tackling car sequencing problems using a generic genetic algorithm
Evolutionary Computation
ILP Through Propositionalization and Stochastic k-Term DNF Learning
Inductive Logic Programming
Managing Conditional and Composite CSPs
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
A Stochastic Local Search Approach to Vertex Cover
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
A conflict based SAW method for constraint satisfaction problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Massively parallel evolution of SAT heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
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
The hyper system: knowledge reformation for efficient first-order hypothetical reasoning
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
The effect of Nogood recording in DPLL-CBJ SAT algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Enhanced probabilistic filtering for improving the efficiency of local searches
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Inc*: an incremental approach for improving local search heuristics
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Generating SAT local-search heuristics using a GP hyper-heuristic framework
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
The breakout method for escaping from local minima
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
An empirical study of greedy local search for satisfiability testing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Variable-selection heuristics in local search for SAT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Enhancements of branch and bound methods for the maximal constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A second order parameter for 3SAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Heuristic-biased stochastic sampling
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
Combining local search and backtracking techniques for constraint satisfaction
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Journal of Automated Reasoning
Querying uncertain data with aggregate constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
GPU computation in bioinspired algorithms: a review
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Penalty logic and its link with Dempster-Shafer theory
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Tie breaking in clause weighting local search for SAT
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Relative generic computational forensic techniques
IH'04 Proceedings of the 6th international conference on Information Hiding
Conditional and composite temporal CSPs
Applied Intelligence
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
Longer-Term memory in clause weighting local search for SAT
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
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
| Hi-index | 0.00 |
GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure. GSAT also efficiently solves encodings of graph coloring problems, N-queens, and Boolean induction. However, GSAT does not perform as well on handcrafted encodings of blocks-world planning problems and formulas with a high degree of asymmetry. We present three strategies that dramatically improve GSAT's performance on such formulas. These strategies, in effect, manage to uncover hidden structure in the formula under considerations, thereby significantly extending the applicability of the GSAT algorithm.