EduSAT: A Pedagogical Tool for Theory and Applications of Boolean
Satisfiability
- URL: http://arxiv.org/abs/2308.07890v1
- Date: Tue, 15 Aug 2023 17:31:35 GMT
- Title: EduSAT: A Pedagogical Tool for Theory and Applications of Boolean
Satisfiability
- Authors: Yiqi Zhao, Ziyan An, Meiyi Ma, Taylor Johnson
- Abstract summary: EduSAT is a tool designed to support learning and understanding of SAT and Satisfiability Modulo Theories (SMT) solving.
It offers implementations of key algorithms and solver abstractions for five NP-complete problems beyond SAT and SMT.
Users can benefit from EduSAT by experimenting, analyzing, and validating their understanding of SAT and SMT solving techniques.
- Score: 4.392308906793852
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are
widely used in automated verification, but there is a lack of interactive tools
designed for educational purposes in this field. To address this gap, we
present EduSAT, a pedagogical tool specifically developed to support learning
and understanding of SAT and SMT solving. EduSAT offers implementations of key
algorithms such as the Davis-Putnam-Logemann-Loveland (DPLL) algorithm and the
Reduced Order Binary Decision Diagram (ROBDD) for SAT solving. Additionally,
EduSAT provides solver abstractions for five NP-complete problems beyond SAT
and SMT. Users can benefit from EduSAT by experimenting, analyzing, and
validating their understanding of SAT and SMT solving techniques. Our tool is
accompanied by comprehensive documentation and tutorials, extensive testing,
and practical features such as a natural language interface and SAT and SMT
formula generators, which also serve as a valuable opportunity for learners to
deepen their understanding. Our evaluation of EduSAT demonstrates its high
accuracy, achieving 100% correctness across all the implemented SAT and SMT
solvers. We release EduSAT as a python package in .whl file, and the source can
be identified at https://github.com/zhaoy37/SAT_Solver.
Related papers
- GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection [45.222591894755105]
We present GraSS, a novel approach for automatic SAT solver selection based on tripartite graph representations of instances.
We enrich the graph representation with domain-specific decisions, such as novel node feature design.
We demonstrate that this combination of raw representations and domain-specific choices leads to improvements in runtime.
arXiv Detail & Related papers (2024-05-17T18:00:50Z) - AutoSAT: Automatically Optimize SAT Solvers via Large Language Models [10.87846542244079]
We present AutoSAT, a novel framework for automatically optimizing SAT solvers.
AutoSAT is based on Large Language Models (LLMs) which is able to autonomously generate codes.
AutoSAT operates on a plug-and-play basis, eliminating the need for extensive enterprise and model training.
arXiv Detail & Related papers (2024-02-16T14:04:56Z) - Decomposing Hard SAT Instances with Metaheuristic Optimization [52.03315747221343]
We introduce the notion of decomposition hardness (d-hardness)
We show that the d-hardness expresses an estimate of the hardness of $C$ w.r.t.
arXiv Detail & Related papers (2023-12-16T12:44:36Z) - A hybrid Quantum proposal to deal with 3-SAT problem [75.38606213726906]
This paper presents and describes a hybrid quantum computing strategy for solving 3-SAT problems.
The performance of this approximation has been tested over a set of representative scenarios when dealing with 3-SAT from the quantum computing perspective.
arXiv Detail & Related papers (2023-06-07T12:19:22Z) - W2SAT: Learning to generate SAT instances from Weighted Literal
Incidence Graphs [13.173307471333619]
W2SAT is a framework to generate SAT formulas by learning intrinsic structures and properties from given real-world/industrial instances.
We introduce a novel SAT representation called Weighted Literal Incidence Graph (WLIG), which exhibits strong representation ability and generalizability.
Decoding from WLIG into SAT problems is then modeled as finding overlapping cliques with a novel hill-climbing optimization method.
arXiv Detail & Related papers (2023-02-01T06:30:41Z) - Estimating the hardness of SAT encodings for Logical Equivalence
Checking of Boolean circuits [58.83758257568434]
We show that the hardness of SAT encodings for LEC instances can be estimated textitw.r.t some SAT partitioning.
The paper proposes several methods for constructing partitionings, which, when used in practice, allow one to estimate the hardness of SAT encodings for LEC with good accuracy.
arXiv Detail & Related papers (2022-10-04T09:19:13Z) - SATformer: Transformer-Based UNSAT Core Learning [0.0]
This paper introduces SATformer, a Transformer-based approach for the Boolean Satisfiability (SAT) problem.
Rather than solving the problem directly, SATformer approaches the problem from the opposite direction by focusing on unsatisfiability.
SATformer is trained through a multi-task learning approach, using the single-bit satisfiability result and the minimal unsatisfiable core.
Experimental results show that our SATformer can decrease the runtime of existing solvers by an average of 21.33%.
arXiv Detail & Related papers (2022-09-02T11:17:39Z) - DeepSAT: An EDA-Driven Learning Framework for SAT [9.111341161918375]
We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem.
DeepSAT achieves significant accuracy improvements over state-of-the-art learning-based SAT solutions.
arXiv Detail & Related papers (2022-05-27T03:20:42Z) - Machine Learning Methods in Solving the Boolean Satisfiability Problem [72.21206588430645]
The paper reviews the recent literature on solving the Boolean satisfiability problem (SAT) with machine learning techniques.
We examine the evolving ML-SAT solvers from naive classifiers with handcrafted features to the emerging end-to-end SAT solvers such as NeuroSAT.
arXiv Detail & Related papers (2022-03-02T05:14:12Z) - Transformer-based Machine Learning for Fast SAT Solvers and Logic
Synthesis [63.53283025435107]
CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems.
In this work, we propose a one-shot model derived from the Transformer architecture to solve the MaxSAT problem.
arXiv Detail & Related papers (2021-07-15T04:47:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.