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☆48Updated this week
- General meta-Heuristic Optimization Solving Toolkit☆37Updated 3 weeks ago
- The top three SAT solvers of 2021: kissat-MAB, lstech_maple, and kissat_gb.☆21Updated 4 months ago
- Learning Heuristic Selection with Dynamic Algorithm Configuration (AI Planning)☆8Updated 10 months ago
- Official repository for paper "Goal-Aware Neural SAT Solver"☆17Updated 2 years ago
- Multi-core Decision Diagram (BDD/LDD) implementation☆44Updated last year
- Sequential object-oriented simPlex☆69Updated last week
- Modeling and Programming with Gecode☆51Updated 2 years ago
- ☆11Updated 3 years ago
- Probabilistic programming system for fast and exact symbolic inference☆81Updated last year
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆59Updated last year
- FOND4LTLf translates an LTLf/PLTLf-FOND to standard FOND planning problems☆16Updated 9 months ago
- Implementation of a differentiable CGP (Cartesian Genetic Programming)☆111Updated 2 years ago
- The Chuffed CP solver☆108Updated 3 months ago
- A toolbox for logical and probabilistic reasoning, StarAI, ILP and Program synthesis☆23Updated 4 years ago
- STRIPS benchmarks for classical planning☆13Updated 3 years ago
- High dimensional black-box optimizer using Latent Action Monte Carlo Tree Search algorithm☆28Updated 2 years ago
- ☆32Updated last year
- Hypergraph Neural Network-Based Combinatorial Optimization☆89Updated 10 months ago
- A standalone local search solver for general mixed integer programming☆24Updated 3 weeks ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆66Updated last year
- Lernd is ∂ILP (dILP) framework implementation based on Deepmind's paper Learning Explanatory Rules from Noisy Data.☆24Updated 2 years ago
- Parallel Presolve for Integer and Linear Optimization☆73Updated 2 weeks ago
- A formalization of first-order logic and Peano's axioms in Python☆20Updated last month
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆32Updated 4 months ago
- A lightweight framework for the efficient parsing and manipulation of PDDL in lifted form.☆17Updated last year
- Representing CP problems as graphs☆19Updated 7 months ago
- A toy compiler for NumPy array expressions that uses e-graphs and MLIR☆70Updated 3 weeks ago
- ☆41Updated last year