shi27feng / transformers.satisfy
propositional satisfiability problem (SAT) goes neural and deep
☆12Updated 3 years ago
Alternatives and similar repositories for transformers.satisfy:
Users that are interested in transformers.satisfy are comparing it to the libraries listed below
- Official repository for paper "Goal-Aware Neural SAT Solver"☆15Updated last year
- PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers☆40Updated last year
- Learning local search heuristics for Boolean satisfiability☆37Updated 10 months ago
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 4 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- G2SAT: Learning to Generate SAT Formulas☆50Updated 4 years ago
- Implementation of local search-based algorithms for solving SAT and Max-SAT in Python☆13Updated 4 years ago
- PyTorch implementation for the Deep Symbolic Simplification Without Human Knowledge☆14Updated 4 years ago
- Python version of tools to work with AIG formatted files☆10Updated 10 months ago
- PyTorch implementation of NeuroSAT☆28Updated last year
- ☆21Updated 2 years ago
- ☆17Updated last year
- Code for the NeurIPS 2020 paper Efficient Exact Verification of Binarized Neural Networks☆13Updated 2 years ago
- ☆11Updated 3 years ago
- LLM4HWDesign Starting Toolkit☆17Updated 5 months ago
- Problems and Results of IWLS 2023 Programming Contest☆16Updated last year
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆45Updated 5 years ago
- ☆14Updated last year
- Metal: Learning a Meta-Solver for Syntax-Guided Program Synthesis☆15Updated 6 years ago
- Automatic generation of architecture-level models for hardware from its RTL design.☆14Updated last year
- ☆43Updated last year
- Arithmetic multiplier benchmarks☆11Updated 7 years ago
- QuteRTL: A RTL Front-End Towards Intelligent Synthesis and Verification☆14Updated 8 years ago
- A framework to ease parallelization of sequential SAT solvers☆16Updated 2 weeks ago
- A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.☆12Updated 6 months ago
- ☆11Updated last year
- GLSearch: Maximum Common Subgraph Detection via Learning to Search☆22Updated last year
- ☆13Updated 4 years ago
- ☆10Updated 2 years ago
- Random Generator of Btor2 Files☆10Updated last year