Skip to content
Research Article Open access CC BY 4.0

Reducing the Cost of Exploring Neighborhood Areas in Dynamic Local Search for SAT

Abdelraouf Ishtaiwi, Ghassan Issa, Wael Hadi

Current Journal of Applied Science and Technology · pp. 1–9 · Published 1 Jan 2018

10.9734/CJAST/2017/38361

Abstract

Stochastic Local Search (SLS) algorithms are of great importance to many fields of Computer Sciences and Artificial Intelligence. This is due to their efficient performance when applied for solving randomly generated satisfiability problems (SAT). Our focus in the current work is on one of the SLS dynamic weighting approaches known as multi-level weight distribution (mulLWD). We experimentally investigated the performance and the weight behaviors of mulLWD. Based on our experiments, we observed that the 2nd level weights movements could lead to poor performance of mulLWD, especially when applied for solving large and harder SAT problems. Therefore, we developed a new heuristic that could reduce the cost of the 2nd level neighborhood exploitation known as partial multi-level weight distribution mulLWD+. Experimental results indicate that mulLWD+ heuristic has significantly better performance than mulLWD in a wide range of SAT problems.

Artificial intelligence Boolean satisfiability search algorithms

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.