Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
An introduction to genetic algorithms
An introduction to genetic algorithms
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
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Lagrangian reconstruction of GENET
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization
CP '99 Proceedings of the 5th 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
CVC: A Cooperating Validity Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Reducing search space in local search for constraint satisfaction
Eighteenth national conference on Artificial intelligence
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
GASAT: a genetic local search algorithm for the satisfiability problem
Evolutionary Computation
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A new clause learning scheme for efficient unsatisfiability proofs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A dynamic approach to MPE and weighted MAX-SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
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
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
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
The satisfiability problem (SAT), as one of the six basic core NP-complete problems, has been the deserving object of many studies in the last two decades [1]. Stochastic local search and genetic algorithms are two current state-of-the-art techniques for solving the SATs. GASAT [2,1] and SAT-WAGA [4] are two current state-of-the-art genetic algorithms for solving SATs. Beside, the discrete lagrange-multiplier (DLM) [8-10] and the exponentiated subgradient algorithms (ESG) [12] are the current state-of-the-art local search algorithms for solving SATs. In this paper, we compare DLM and ESG with GASAT and SAT-WAGA. We show that the performance of the local search-based algorithms: DLM and ESG is better than the performance of the genetic-based algorithms: GASAT and SAT-WAGA. We further analyze the results of the comparisons. We hope these comparisons give light to the researchers while researching in genetic and local search algorithms, help understanding of the reasons for these algorithms' performance and behaviour and to the new researchers who are in the process of choosing research direction.