research-article

Open access

Late Breaking Results: Differential and Massively Parallel Sampling of SAT Formulas

Authors:

John WawrzynekAuthors Info & Claims

DAC '24: Proceedings of the 61st ACM/IEEE Design Automation Conference

Article No.: 356, Pages 1 - 2

https://doi.org/10.1145/3649329.3663505

Published: 07 November 2024 Publication History

PDF eReader

Abstract

Diverse solutions to the Boolean satisfiability (SAT) problem are essential for thorough testing and verification of software and hardware designs, ensuring reliability and applicability to real-world scenarios. We introduce a novel differentiable sampling method, called DiffSampler, which employs gradient descent (GD) to learn diverse solutions to the SAT problem. By formulating SAT as a supervised multi-output regression task and minimizing its loss function using GD, our approach enables performing the learning operations in parallel, leading to GPU-accelerated sampling and comparable run time performance w.r.t. heuristic samplers. We demonstrate that DiffSampler can generate diverse uniform-like solutions similar to conventional samplers.

References

[1]

P. Golia et al., "Designing samplers is easy: The boon of testers," in Proc. of Formal Methods in Computer-Aided Design (FMCAD), 2021.

Google Scholar

[2]

M. Soos et al., "Tinted, detached, and lazy cnf-xor solving and its applications to counting and sampling," in Proceedings of International Conference on Computer-Aided Verification (CAV), 2020.

Google Scholar

[3]

R. Dutra et al., "Efficient sampling of sat solutions for testing," in Proc. of the International Conference on Software Engineering, 2018.

Google Scholar

[4]

C. Costa, "Parallelization of sat algorithms on gpus," Technical report, INESC-ID, Technical University of Lisbon, Tech. Rep., 2013.

Google Scholar

[5]

M. Osama et al., "Sat solving with gpu accelerated inprocessing," in International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 2021, pp. 133--151.

Google Scholar

[6]

J. Gu, "Global optimization for satisfiability (sat) problem," IEEE Trans. on Knowledge and Data Engineering, vol. 6, no. 3, pp. 361--381, 1994.

Digital Library

Google Scholar

[7]

T. Sato et al., "Matsat: a matrix-based differentiable sat solver," arXiv preprint arXiv:2108.06481, 2021.

Google Scholar

[8]

Y. Pote et al., "On scalable testing of samplers," in Advances in Neural Information Processing Systems (NeurIPS), 2022.

Google Scholar

Cited By

View all

Ardakani AKang MHe KHuang QIyer VMoon SWawrzynek JNakamura YWang Y(2025)DEMOTIC: A Differentiable Sampler for Multi-Level Digital CircuitsProceedings of the 30th Asia and South Pacific Design Automation Conference10.1145/3658617.3697760(1328-1335)Online publication date: 20-Jan-2025
https://dl.acm.org/doi/10.1145/3658617.3697760

Index Terms

Late Breaking Results: Differential and Massively Parallel Sampling of SAT Formulas

Index terms have been assigned to the content through auto-classification.

Recommendations

On Some SAT-Variants over Linear Formulas
SOFSEM '09: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

We investigate the computational complexity of some prominent variants of the propositional satisfiability problem (SAT), namely not-all-equal SAT (NAE-SAT) and exact SAT (XSAT) restricted to the class of linear conjunctive normal form (CNF) formulas. ...
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
DAC '09: Proceedings of the 46th Annual Design Automation Conference

Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solvers are based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm and ...
Properties of SLUR formulae
SOFSEM'12: Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Single look-ahead unit resolution (SLUR) algorithm is a nondeterministic polynomial time algorithm which for a given input formula in a conjunctive normal form (CNF) either outputs its satisfying assignment or gives up. A CNF formula belongs to the SLUR ...

Comments

Information & Contributors

Information

Published In

DAC '24: Proceedings of the 61st ACM/IEEE Design Automation Conference

June 2024

2159 pages

ISBN:9798400706011

DOI:10.1145/3649329

Chair:
Vivek De

This work is licensed under a Creative Commons Attribution-ShareAlike International 4.0 License.

In-Cooperation

SIGBED: ACM Special Interest Group on Embedded Systems

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2024

Check for updates

Qualifiers

Research-article

Conference

DAC '24

Sponsor:

SIGDA

DAC '24: 61st ACM/IEEE Design Automation Conference

June 23 - 27, 2024

CA, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
186
Total Downloads

Downloads (Last 12 months)186
Downloads (Last 6 weeks)100

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ardakani AKang MHe KHuang QIyer VMoon SWawrzynek JNakamura YWang Y(2025)DEMOTIC: A Differentiable Sampler for Multi-Level Digital CircuitsProceedings of the 30th Asia and South Pacific Design Automation Conference10.1145/3658617.3697760(1328-1335)Online publication date: 20-Jan-2025
https://dl.acm.org/doi/10.1145/3658617.3697760

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On Some SAT-Variants over Linear Formulas

Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Properties of SLUR formulae

Comments

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

On Some SAT-Variants over Linear Formulas

Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Properties of SLUR formulae

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations