arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.00272cs.LGcs.AI
收藏

W2SAT:学习从加权文字关联图生成 SAT 实例

W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs

Weihuang Wen, Tianshu Yu

AI总结:

本文提出 W2SAT 框架,通过学习加权文字关联图(WLIG)的内在结构来生成高质量 SAT 实例,并利用最优权重覆盖(OWC)方法解码,有效缓解了工业级 SAT 数据匮乏问题。

摘要:

布尔可满足性(SAT)问题是理论计算机科学中一个引人注目的 NP 完全问题,并在广泛的计算相关应用中扮演核心角色。在众多场景下探索和调优 SAT 求解器需要海量高质量的工业级 SAT 实例,但遗憾的是,现实世界中此类实例相当有限。为解决数据不足问题,本文提出 W2SAT,这是一个通过以隐式方式学习给定现实/工业实例的内在结构和属性来生成 SAT 公式的框架。为此,我们引入了一种名为加权文字关联图(WLIG)的新型 SAT 表示方法,相较于现有方法,它展现出强大的表示能力和泛化能力,并可通过专门的基于学习的图生成模型高效生成。随后,将 WLIG 解码为 SAT 问题被建模为寻找重叠团,并采用一种名为最优权重覆盖(OWC)的新型爬山优化方法。实验表明,与以往方法相比,我们基于 WLIG 的方法在图指标、效率和可扩展性方面具有优越性。此外,我们讨论了基于图的 SAT 生成在实际应用中的局限性,特别是在利用生成的实例进行 SAT 求解器参数调优时,并提出了一些潜在的研究方向。

英文摘要:

The Boolean Satisfiability (SAT) problem stands out as an attractive NP-complete problem in theoretic computer science and plays a central role in a broad spectrum of computing-related applications. Exploiting and tuning SAT solvers under numerous scenarios require massive high-quality industry-level SAT instances, which unfortunately are quite limited in the real world. To address the data insufficiency issue, in this paper, we propose W2SAT, a framework to generate SAT formulas by learning intrinsic structures and properties from given real-world/industrial instances in an implicit fashion. To this end, we introduce a novel SAT representation called Weighted Literal Incidence Graph (WLIG), which exhibits strong representation ability and generalizability against existing counterparts, and can be efficiently generated via a specialized learning-based graph generative model. Decoding from WLIGs into SAT problems is then modeled as finding overlapping cliques with a novel hill-climbing optimization method termed Optimal Weight Coverage (OWC). Experiments demonstrate the superiority of our WLIG-induced approach in terms of graph metrics, efficiency, and scalability in comparison to previous methods. Additionally, we discuss the limitations of graph-based SAT generation for real-world applications, especially when utilizing generated instances for SAT solver parameter-tuning, and pose some potential directions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑