GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
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 Lagrangian reconstruction of GENET
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Boosting complete techniques thanks to local search methods
Annals of Mathematics and 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
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
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
The island confinement method for reducing search space in local search methods
Journal of Heuristics
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
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
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
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Speeding up Local Search By Using the Island Confinement Method
Speeding up Local Search By Using the Island Confinement Method
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
| Hi-index | 0.00 |
The satisfiability SAT problem, as one of the six basic core NP-complete problems, has been the deserving object of many studies in the last two decades. Stochastic local search algorithms SLSA are one of the current state-of-the-art techniques for solving the SAT problems. Kilani and Fang et al. introduced the island confinement method ICM for reducing the search space in SLSA. They incorporate this idea into two SLSA: DLM and ESG. Their new algorithms, DLMIr, DLMI2004 and ESGI, show far better results than DLM and ESG respectively after the incorporation process. In this research, we create a stand-alone solver, IslandSAT solver, based on the ICM that is independent of any SLSA. We show through experimentation that IslandSAT is competitive to DLMI2004 and far better than ESGI. Furthermore, we find that Island-SAT is competitive to the state-of-the-art SLSA, TNM and adaptg2wsat2009++, for solving the SAT problems.