StructureSAT是一个大规模的饱和问题（SAT）数据集，由新南威尔士大学计算机科学与工程学院创建。该数据集包含来自不同问题领域的多样化SAT问题，旨在研究图神经网络（GNN）在SAT问题上的泛化能力。数据集涵盖了随机、设计、伪工业和工业等11个SAT领域，并研究了9种对传统SAT求解器有影响的图形结构属性。数据集通过结构属性对问题领域进行细分，以研究不同结构属性对GNN求解器泛化能力的影响

arXiv2025-02-17 更新110

Analyzed Benchmarks on Experiments for a SAT Time Leap Challenge

SAT时间跳跃挑战

SAT布尔可满足性问题

For details see: Johannes K. Fichte, Markus Hecher, Stefan Szeider: A Time Leap Challenge for SAT-Solving, Proceedings of the 26th International Conference on Principles and Practice of Constraint Pro

Zenodo2020-07-17 更新40

Distributed SAT Competition 2005 Industrial Track Benchmarks

SAT布尔可满足性问题

形式化验证

These are 176 CNF files in DIMACS format from the industrial track of the SAT competition 2005 which were distributed after the competition. Some benchmarks were only available on webpages of submitt

NIAID Data Ecosystem20

Distributed SAT Competition 2003 Industrial Track Benchmarks

资源简介：

Distributed SAT Competition 2003 Industrial Track Benchmarks

资源简介：

相关数据集