Alternatives and similar repositories for glasgow-subgraph-solver:

Users that are interested in glasgow-subgraph-solver are comparing it to the libraries listed below

• meelgroup / ganak
  The first scalable probabilistic exact counter
  ☆31Updated this week
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆49Updated 2 years ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆19Updated 5 months ago
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆33Updated last year
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆52Updated last year
• fbacchus / MaxHS
  MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus
  ☆26Updated 3 years ago
• arminbiere / gimsatul
  ☆34Updated 8 months ago
• dselsam / neurocore-public
  NeuroCore: Guiding CDCL with Unsat-Core Predictions
  ☆45Updated 5 years ago
• audemard / glucose
  The glucose SAT solver
  ☆96Updated 4 months ago
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆65Updated this week
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆64Updated 10 months ago
• FlorentAvellaneda / EvalMaxSAT
  State-of-the-art MaxSAT Solver & Library Based on Unsat Core Guided Techniques
  ☆16Updated 11 months ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated last year
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆78Updated last year
• Laakeri / sharpsat-td
  Entry to model counting competition 2021.
  ☆20Updated 9 months ago
• latte-int / latte
  LattE integrale, software for counting lattice points and integration over convex polytopes
  ☆47Updated last year
• muhos / ParaFROST
  A Parallel SAT Solver with GPU Accelerated Inprocessing
  ☆97Updated last week
• arminbiere / lingeling
  Lingeling SAT Solver
  ☆100Updated last year
• ivmai / cudd
  CUDD: CU Decision Diagram package - unofficial git mirror of https://web.archive.org/web/20180127051756/http://vlsi.colorado.edu/~fabio/C…
  ☆126Updated last year
• liffiton / PyMiniSolvers
  A Python API for the MiniSat and MiniCard constraint solvers.
  ☆20Updated last year
• SSoelvsten / buddy
  BuDDy BDD package (with CMake support)
  ☆12Updated 10 months ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆123Updated 2 years ago
• meelgroup / approxmc
  Approximate Model Counter
  ☆75Updated this week
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆42Updated last year
• shaowei-cai-group / ParKissat-RS
  Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)
  ☆23Updated 2 years ago
• zhaoyu-li / G4SATBench
  [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks
  ☆34Updated 10 months ago
• sat-heritage / docker-images
  SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers
  ☆38Updated 2 years ago
• SSoelvsten / adiar
  An I/O-efficient implementation of (Binary) Decision Diagrams
  ☆27Updated 2 weeks ago
• maximaximal / Paracooba
  Distributed and ressource elastic cube-and-conquer SAT & QBF solver
  ☆18Updated 2 years ago
• tulip-control / dd
  Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy
  ☆195Updated this week