Alternatives and similar repositories for AutoIG

Users that are interested in AutoIG are comparing it to the libraries listed below

• MiniZinc / mzn-challenge
  An archive repository containing the MiniZinc instances used for the MiniZinc Challenge
  ☆13Updated 5 months ago
• Kurorororo / numeric-fast-downward
  ☆14Updated last year
• PesantGilles / MiniCPBP
  Replacing standard support propagation by belief propagation in MiniCP
  ☆12Updated last month
• stolba / MADLAPlanner
  Multiagent Distributed and Local Asynchronous Planner. A deterministic domain-independent multi-agent planner based on the MA-STRIPS form…
  ☆12Updated 7 years ago
• conjure-cp / EssenceCatalog
  A collection of problem specifications in Essence.
  ☆10Updated last week
• fawcettc / planning-features
  Scalar feature extractor for AI planning problems and domains in PDDL format
  ☆15Updated 4 years ago
• corail-research / SeaPearl.jl
  Julia hybrid constraint programming solver enhanced by a reinforcement learning driven search.
  ☆169Updated last year
• williamshen-nz / STRIPS-HGN
  Learning Domain-Independent Planning Heuristics over Hypergraphs (ICAPS'20)
  ☆13Updated last month
• airbus / discrete-optimization
  Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.
  ☆58Updated last month
• abcorrea / powerlifted
  Powerlifted Planner
  ☆30Updated 5 months ago
• CPMpy / PyConA
  A cpmpy-based library for constraint acquisition.
  ☆17Updated 2 months ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated last year
• StephanGocht / VeriPB
  Verifier for pseudo-Boolean proofs
  ☆14Updated 2 years ago
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 10 months ago
• fraleo / OMTPlan
  A python framework for Optimal Planning Modulo Theories
  ☆11Updated last year
• google-research / tf-opt
  ☆39Updated last month
• qcappart / hybrid-cp-rl-solver
  Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
  ☆191Updated 4 years ago
• ehebrard / Mistral-2.0
  ☆32Updated last year
• domain-independent-dp / didp-rs
  Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.
  ☆42Updated last month
• DillonZChen / wlplan
  Relational Features for PDDL Planning
  ☆11Updated last month
• ConSol-Lab / Pumpkin
  A lazy clause generation constraint solver written in Rust.
  ☆30Updated this week
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆21Updated 2 months ago
• aiplan4eu / up-fast-downward
  Integration of the planning system Fast Downward with the unified-planning framework.
  ☆11Updated 4 months ago
• corail-research / learning-generic-csp
  Representing CP problems as graphs
  ☆18Updated 4 months ago
• xcsp3team / ACE
  Constraint Solver ACE
  ☆30Updated this week
• QuMuLab / python-nnf
  Manipulate NNF (Negation Normal Form) logical sentences
  ☆17Updated 2 years ago
• ryanzhangfan / NeuroSAT
  PyTorch implementation of NeuroSAT
  ☆28Updated last year
• xcsp3team / pycsp3
  A Python Library for modeling combinatorial constrained problems
  ☆67Updated this week
• aig-upf / tarski
  Tarski - An AI Planning Modeling Framework
  ☆65Updated last year
• Opt-Mucca / Adaptive-Cutsel-MILP
  Adaptive Cut Selection in Mixed-Integer Linear Programming
  ☆13Updated last year