Community-based 3-SAT formulas with a predefined solution Online publication date: Mon, 21-Mar-2022
by Yamin Hu; Wenjian Luo; Junteng Wang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 21, No. 4, 2021
Abstract: It is crucial to generate SAT formulas with predefined solutions for the development of SAT solvers since many SAT formulas from real-world applications have solutions. Although some algorithms have been proposed to generate SAT formulas with predefined solutions, community structures of SAT formulas are not considered in these algorithms. Consequently, we propose a 3-SAT formula generating algorithm that not only guarantees the existence of a predefined solution, but also simultaneously considers community structures and clause distributions. To study the effect of community structures and clause distributions on the hardness of SAT formulas, we measure solving runtimes of two solvers, gluHack and CPSparrow, on the generated SAT formulas under different parameter settings. Through extensive experiments, we obtain some noteworthy observations. For example, the community structure has few or no effects on the hardness of SAT formulas with regard to CPSparrow but a strong effect with regard to gluHack.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and 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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook