by Yousef Kilani; Mohammad Bsoul; Ibrahim Obeidat; Mamoun Al-Rababaa
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 4, No. 3/4, 2012

Abstract: 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.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email