emreyolcu / sat
Learning local search heuristics for Boolean satisfiability
☆37Updated 9 months ago
Alternatives and similar repositories for sat:
Users that are interested in sat are comparing it to the libraries listed below
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆53Updated 4 years ago
- PyTorch implementation of NeuroSAT☆28Updated last year
- G2SAT: Learning to Generate SAT Formulas☆48Updated 4 years ago
- [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"☆18Updated last year
- ☆10Updated last year
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆44Updated 5 years ago
- Winner of NeurIPS 2021 student leaderboard. Self-bootstrapping bayesian optimization for SCIP configuration using GNNs.☆13Updated 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
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆48Updated 2 years ago
- Implementation of the paper "Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning".☆25Updated 5 years ago
- NLocalSAT; Boosting Local Search with Solution Prediction☆18Updated last year
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Updated 4 years ago
- Learning to Perform Local Rewriting for Combinatorial Optimization☆150Updated 5 years ago
- A benchmarking suite for maximum independent set solvers.☆49Updated last year
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆25Updated 3 years ago
- ☆35Updated last year
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 5 months ago
- ☆23Updated 4 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆129Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆97Updated last year
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆35Updated 9 months ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆30Updated 5 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆29Updated 4 months ago
- Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}☆72Updated 2 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆34Updated 5 months ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- GLSearch: Maximum Common Subgraph Detection via Learning to Search☆22Updated last year
- PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers☆40Updated last year
- Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"☆30Updated 4 years ago
- Extending the Neural Graph Algorithm Executor☆13Updated 2 years ago