BriefGPT.xyz
Feb, 2023
W2SAT: 从加权文字关系图中学习生成SAT实例
W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs
HTML
PDF
Weihuang Wen, Tianshu Yu
TL;DR
本文提出了一种基于WLIG的SAT公式生成框架W2SAT,并通过实验证明了WLIG的优越性及其与其他方法的差异,并讨论了其在实际应用中的局限性以及可能的解决方案。
Abstract
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
→