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 7 months ago
• fawcettc / planning-features
  Scalar feature extractor for AI planning problems and domains in PDDL format
  ☆15Updated 4 years ago
• Kurorororo / numeric-fast-downward
  ☆15Updated last year
• DillonZChen / wlplan
  Relational Features for PDDL Planning
  ☆12Updated this week
• CPMpy / PyConA
  A cpmpy-based library for constraint acquisition.
  ☆18Updated last month
• PesantGilles / MiniCPBP
  Replacing standard support propagation by belief propagation in MiniCP
  ☆13Updated last week
• conjure-cp / EssenceCatalog
  A collection of problem specifications in Essence.
  ☆10Updated last month
• abcorrea / powerlifted
  Powerlifted Planner
  ☆31Updated 6 months ago
• fraleo / OMTPlan
  A python framework for Optimal Planning Modulo Theories
  ☆11Updated last year
• chuffed / chuffed
  The Chuffed CP solver
  ☆105Updated 2 months ago
• geoffchu / chuffed
  The CP solver Chuffed
  ☆20Updated 8 years ago
• AI-Planning / autoscale-benchmarks
  STRIPS benchmarks for classical planning
  ☆13Updated 3 years ago
• CPMpy / cpmpy
  Constraint Programming and Modeling library in Python, based on numpy, with direct solver access.
  ☆264Updated this week
• williamshen-nz / STRIPS-HGN
  Learning Domain-Independent Planning Heuristics over Hypergraphs (ICAPS'20)
  ☆13Updated 3 months ago
• ConSol-Lab / Pumpkin
  A lazy clause generation constraint solver written in Rust.
  ☆30Updated last week
• Opt-Mucca / Adaptive-Cutsel-MILP
  Adaptive Cut Selection in Mixed-Integer Linear Programming
  ☆13Updated last year
• tomasgeffner / FOND-SAT
  FOND solver based on SAT
  ☆14Updated 2 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆23Updated 3 months ago
• airbus / discrete-optimization
  Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.
  ☆60Updated last week
• corail-research / SeaPearl.jl
  Julia hybrid constraint programming solver enhanced by a reinforcement learning driven search.
  ☆168Updated last year
• chocoteam / pychoco
  ☆15Updated last week
• aibasel / downward-benchmarks
  ☆38Updated 7 months ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated 2 years ago
• QuMuLab / python-nnf
  Manipulate NNF (Negation Normal Form) logical sentences
  ☆17Updated 2 years ago
• MLopez-Ibanez / irace
  Iterated Racing for Automatic Algorithm Configuration
  ☆63Updated last week
• IBM / forbiditerative
  ForbidIterative planners for top-k, top-quality, and diverse planning problems
  ☆19Updated last month
• aig-upf / tarski
  Tarski - An AI Planning Modeling Framework
  ☆67Updated last year
• StephanGocht / VeriPB
  Verifier for pseudo-Boolean proofs
  ☆14Updated 2 years ago
• 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
• domain-independent-dp / didp-rs
  Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.
  ☆44Updated 2 weeks ago