Refutational theorem proving using term-rewriting systems
Artificial Intelligence
Artificial intelligence (2nd ed.)
Artificial intelligence (2nd ed.)
Principles of artificial intelligence
Principles of artificial intelligence
Introduction to algorithms
A polynomial time algorithm for the N-Queens problem
ACM SIGART Bulletin
3,000,000 Queens in less than one minute
ACM SIGART Bulletin
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A modular partitioning approach for asynchronous circuit synthesis
DAC '94 Proceedings of the 31st annual Design Automation Conference
A divide-and-conquer approach for asynchronous interface synthesis
ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
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
Efficient Local Search for DAG Scheduling
IEEE Transactions on Parallel and Distributed Systems
Multi-agent oriented constraint satisfaction
Artificial Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
Journal of Global Optimization
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Local Search for DAG Scheduling and Task Assignment
ICPP '97 Proceedings of the international Conference on Parallel Processing
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
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
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Analysis of Random Noise and Random Walk Algorithms
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Integrating local search and network flow to solve the inventory routing problem
Eighteenth national conference on Artificial intelligence
A mixture-model for the behaviour of SLS algorithms for SAT
Eighteenth national conference on Artificial intelligence
Parallelizing local search for CNF satisfiability using vectorization and PVM
Journal of Experimental Algorithmics (JEA)
SAT problems with chains of dependent variables
Discrete Applied Mathematics - The renesse issue on satisfiability
Design-as-satisfiability: A new approach to automated synthesis
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
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
Local search for quantified Boolean formulas
Proceedings of the 43rd annual Southeast regional conference - Volume 1
A GRASP algorithm to solve the unicost set covering problem
Computers and Operations Research
A numerical approach to genetic programming for system identification
Evolutionary Computation
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Adaptive Algorithmic Hybrids for Human-Level Artificial Intelligence
Proceedings of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006
An empirical analysis of search in GSAT
Journal of Artificial Intelligence Research
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
SAT-encodings, search space structure, and local search performance
IJCAI'99 Proceedings of the 16th 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
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
An architecture for adaptive algorithmic hybrids
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT
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
Local search algorithms for partial MAXSAT
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
Adding new clauses for faster local search
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
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Resolution tunnels for improved SAT solver performance
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
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The satisfiability problem (SAT) is a fundamental problem in mathematical logic, inference, automated reasoning, and computing theory. In this correspondence, we report the results of applying local search techniques to solve the satisfiability problem. While a traditional resolution-based algorithm is not able to handle even moderately sized inference problems, a local search algorithm, tested through years of real program execution, is capable of computing very large-scale inference problems with fast, robust convergence. On a workstation computer, for example, it is able to solve a satisfiability problem with 50,000 clauses and 5,000 variables in a few seconds.