zhaoyu-li / NSNetLinks
[NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"
☆19Updated 2 years ago
Alternatives and similar repositories for NSNet
Users that are interested in NSNet are comparing it to the libraries listed below
Sorting:
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆52Updated 5 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- PyTorch implementation of NeuroSAT☆28Updated 2 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆37Updated last year
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- G2SAT: Learning to Generate SAT Formulas☆49Updated 5 years ago
- Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization☆55Updated 2 months ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆46Updated 5 years ago
- A Simple CDCL Solver☆35Updated 2 years ago
- DeepIC3: Guiding IC3 Algorithms by Graph Neural Network Clause Prediction (ASP-DAC 2024)☆11Updated 2 years ago
- [NeurIPS 2024 Datasets and Benchmarks Track] Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime☆23Updated 7 months ago
- ☆23Updated 11 months ago
- propositional satisfiability problem (SAT) goes neural and deep☆13Updated 4 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆32Updated 3 weeks ago
- SATZilla SAT feature extraction tool☆11Updated last year
- A Python toolkit for Machine Learning (ML) practices for Combinatorial Optimization (CO).☆69Updated last week
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆50Updated 3 years ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 10 months ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆17Updated 3 years ago
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated 2 years ago
- Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design S…☆45Updated 5 months ago
- A benchmarking suite for maximum independent set solvers.☆53Updated last year
- ☆10Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- Python version of tools to work with AIG formatted files☆12Updated 5 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated last year
- py-aiger: A python library for manipulating sequential and combinatorial circuits encoded using `and` & `inverter` gates (AIGs).☆48Updated 10 months ago
- 1st Solution For NeurIPS 2021 Competition on ML4CO Dual Task☆29Updated 2 years ago
- PyTorch implementation for the Deep Symbolic Simplification Without Human Knowledge☆14Updated 4 years ago