Alternatives and similar repositories for CDCL-based-SAT-Solver

Users that are interested in CDCL-based-SAT-Solver are comparing it to the libraries listed below

• thtran97 / Local-Search-for-SAT
  Implementation of local search-based algorithms for solving SAT and Max-SAT in Python
  ☆13Updated 4 years ago
• LUMII-Syslab / QuerySAT
  Official repository for paper "Goal-Aware Neural SAT Solver"
  ☆17Updated 2 years ago
• omargup / neural_combinatorial_optimization
  A peper list for machine learning models solving combinatorial problems, NP-hard problems and problems in graphs.
  ☆13Updated 4 years ago
• speckdavid / rl-plan
  Learning Heuristic Selection with Dynamic Algorithm Configuration (AI Planning)
  ☆8Updated 9 months ago
• hkrsnd / dilp-st
  ☆10Updated 4 years ago
• limo1996 / SAT-Solver
  Parallel SAT Solver
  ☆10Updated 7 years ago
• shi27feng / transformers.satisfy
  propositional satisfiability problem (SAT) goes neural and deep
  ☆13Updated 3 years ago
• johannaSommer / generalization-neural-co-solvers
  Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"
  ☆14Updated 2 years ago
• 12wang3 / mllp
  The code of AAAI 2020 paper "Transparent Classification with Multilayer Logical Perceptrons and Random Binarization".
  ☆24Updated last year
• sgomber / CDCL-SAT
  A SAT Solver based on CDCL (Conflict Driven Clause Learning) implemented in python
  ☆19Updated 4 years ago
• zhaoyu-li / NSNet
  [NeurIPS 2022] "NSNet: A General Neural Probabilistic Framework for Satisfiability Problems"
  ☆18Updated 2 years ago
• emreyolcu / sat
  Learning local search heuristics for Boolean satisfiability
  ☆37Updated last year
• Kapilhk / SatPie
  SAT solver based on CDCL in Python with Conflict Driven Clause Learning, clever Heuristics - VSIDS, 2 - Literal watch advanced data struc…
  ☆20Updated 4 years ago
• facebookresearch / LA-MCTS
  High dimensional black-box optimizer using Latent Action Monte Carlo Tree Search algorithm
  ☆28Updated 2 years ago
• zhaoyu-li / G4SATBench
  [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks
  ☆35Updated last year
• WXY1427 / Learn-LNS-policy
  ☆32Updated 2 years ago
• Yujun-Yan / Neural-Execution-Engines
  Code for Neural Execution Engines: Learning to Execute Subroutines
  ☆17Updated 4 years ago
• BeloborodovDS / SIMCIM-RL
  Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization
  ☆14Updated 5 years ago
• ha0ransun / Path-Auxiliary-Sampler
  ☆11Updated 2 years ago
• MIRALab-USTC / L2O-G2MILP
  This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.
  ☆32Updated 9 months ago
• Strong-AI-Lab / A-Neural-Symbolic-Paradigm
  From Symbolic Logic Reasoning to Soft Reasoning: A Neural-Symbolic Paradigm
  ☆11Updated 2 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆23Updated 2 years ago
• microsoft / PDP-Solver
  PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers
  ☆41Updated 2 years ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated 2 years ago
• atavakol / action-hypergraph-networks
  (ICLR 2021) Learning to Represent Action Values as a Hypergraph on the Action Vertices
  ☆23Updated 4 years ago
• keqinw / MAN
  ☆11Updated 2 years ago
• JiazhengZhang / NIRM
  NIRM: Dismantling Complex Networks by a Neural Model Trained from Tiny Networks
  ☆12Updated 2 years ago
• NVIDIA / GraphQSat
  Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver
  ☆52Updated 4 years ago
• eyounx / PRR
  Meta-Reinforcement Learning with Policy Residual Representation
  ☆11Updated 5 years ago
• mit-wu-lab / learning-to-configure-separators
  [NeurIPS 2023] Learning to Configure Separators in Branch-and-Cut
  ☆23Updated last year