文章基本信息

标题：Efficient Tough Random Symmetric 3-SAT Generator
本地全文：下载
作者：Robert Amador ; Chen-Fu Chiang ; Chang-Yu Hsieh 等
期刊名称：Computer Science & Information Technology
电子版ISSN：2231-5403
出版年度：2019
卷号：9
期号：9
页码：41-49
DOI：10.5121/csit.2019.90904
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：We designed and implemented an efficient tough random symmetric 3-SAT generator. We quantify the hardness in terms of CPU time, numbers of restarts, decisions, propagations, conflicts and conflicted literals that occur when a solver tries to solve 3-SAT instances. In this experiment, the clause variable ratio was chosen to be around the conventional critical phase transition number 4.24. The experiment shows that instances generated by our generator are significantly harder than instances generated by the Tough K-SAT generator. The difference in hardness between two SAT instance generators exponentiates as the number of Boolean variables used increases.
关键词：3-SAT; Satisfiability; Efficient Tough Random Symmetric 3-SAT Generator; Critical Phase; Transition