High-Throughput SAT Sampling

In this work, we present a novel technique for GPU-accelerated Boolean satisfiability (SAT) sampling. Unlike conventional sampling algorithms that directly operate on conjunctive normal form (CNF), our method transforms the logical constraints of SAT problems by factoring their CNF representations i...

Full description

Bibliographic Details

Published in:	Proceedings - Design, Automation, and Test in Europe Conference and Exhibition pp. 1 - 7
Main Authors:	Ardakani, Arash, Kang, Minwoo, He, Kevin, Huang, Qijing, Wawrzynek, John
Format:	Conference Proceeding
Language:	English
Published:	EDAA 31.03.2025
Subjects:	Benchmark testing Boolean functions Boolean Satisfiability Distance measurement Gradient Descent Logic Multi-level Circuits Optimization Performance gain Runtime Sampling methods Tensors Testing Transforms Verification
ISSN:	1558-1101
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!