Machine learning methods in solving the boolean satisfiability problem
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT),
an archetypal NP-complete problem, with the aid of machine learning (ML) techniques. Over …
an archetypal NP-complete problem, with the aid of machine learning (ML) techniques. Over …
A systematic survey on deep generative models for graph generation
Graphs are important data representations for describing objects and their relationships,
which appear in a wide diversity of real-world scenarios. As one of a critical problem in this …
which appear in a wide diversity of real-world scenarios. As one of a critical problem in this …
Hardsatgen: Understanding the difficulty of hard sat formula generation and a strong structure-hardness-aware baseline
Industrial SAT formula generation is a critical yet challenging task. Existing SAT generation
approaches can hardly simultaneously capture the global structural properties and maintain …
approaches can hardly simultaneously capture the global structural properties and maintain …
G2sat: Learning to generate sat formulas
Abstract The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem
and is fundamental to computer science, with a wide array of applications in planning …
and is fundamental to computer science, with a wide array of applications in planning …
On the performance of deep generative models of realistic sat instances
Generating realistic random SAT instances-random SAT formulas with computational
characteristics similar to the ones of application SAT benchmarks-is a challenging problem …
characteristics similar to the ones of application SAT benchmarks-is a challenging problem …
Graph neural network based time estimator for SAT solver
SAT-based formal verification is a systematic process to prove the correctness of computer
hardware design based on formal specifications, providing an alternative to time-consuming …
hardware design based on formal specifications, providing an alternative to time-consuming …
Neural fault analysis for sat-based atpg
Continued advances in process technology have led to a relentless increase in the design
complexity of integrated circuits (ICs). In order to meet the increasing demand of low …
complexity of integrated circuits (ICs). In order to meet the increasing demand of low …
W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs
W Wen, T Yu - arxiv preprint arxiv:2302.00272, 2023 - arxiv.org
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 …
theoretic computer science and plays a central role in a broad spectrum of computing …
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
Efficiently determining the satisfiability of a boolean equation--known as the SAT problem for
brevity--is crucial in various industrial problems. Recently, the advent of deep learning …
brevity--is crucial in various industrial problems. Recently, the advent of deep learning …
[PDF][PDF] Lightweight Online Learning for Sets of Related Problems in Automated Reasoning
We present Self-Driven Strategy Learning (SDSL), a lightweight online learning
methodology for automated reasoning tasks that involve solving a set of related problems …
methodology for automated reasoning tasks that involve solving a set of related problems …