RomanKalkreuth / cgp-plusplusLinks
☆13Updated last year
Alternatives and similar repositories for cgp-plusplus
Users that are interested in cgp-plusplus are comparing it to the libraries listed below
Sorting:
- Implementation of local search-based algorithms for solving SAT and Max-SAT in Python☆13Updated 4 years ago
- Program Synthesis framework that features heuristics methods (e.g., Genetic Programming) and grammars are defined in Python dataclasses☆49Updated this week
- The top three SAT solvers of 2021: kissat-MAB, lstech_maple, and kissat_gb.☆21Updated 6 months ago
- Modeling and Programming with Gecode☆50Updated 2 years ago
- Probabilistic programming system for fast and exact symbolic inference☆82Updated last year
- General meta-Heuristic Optimization Solving Toolkit☆38Updated this week
- Official repository for paper "Goal-Aware Neural SAT Solver"☆17Updated 2 years ago
- ☆11Updated 4 years ago
- High dimensional black-box optimizer using Latent Action Monte Carlo Tree Search algorithm☆29Updated 3 years ago
- Parallel SAT Solver☆10Updated 7 years ago
- C++ Large Scale Genetic Programming☆179Updated last month
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆68Updated last year
- a collection of Gymnasium environments for saturation provers☆23Updated 3 weeks ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆61Updated last year
- FOND4LTLf translates an LTLf/PLTLf-FOND to standard FOND planning problems☆16Updated 11 months ago
- Implementation of a differentiable CGP (Cartesian Genetic Programming)☆113Updated 3 years ago
- Sequential object-oriented simPlex☆70Updated 3 weeks ago
- propositional satisfiability problem (SAT) goes neural and deep☆13Updated 4 years ago
- STRIPS benchmarks for classical planning☆13Updated 3 years ago
- The Chuffed CP solver☆111Updated 2 months ago
- A formalization of first-order logic and Peano's axioms in Python☆20Updated 3 months ago
- Lingeling SAT Solver☆105Updated last year
- Parallel Presolve for Integer and Linear Optimization☆75Updated this week
- Lernd is ∂ILP (dILP) framework implementation based on Deepmind's paper Learning Explanatory Rules from Noisy Data.☆25Updated 2 years ago
- ☆24Updated 2 years ago
- ☆41Updated last year
- A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.☆12Updated last year
- Tool for learning linear temporal logic formulas using combinatorial approach☆14Updated 9 months ago
- Code accompanying the manuscript "Constructions in combinatorics via neural networks and LP solvers".☆57Updated 3 years ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated last year