ML-KULeuven / COUNT-CP

COUNT-CP is a constraint learner that uses a generate-and-aggregate approach to learn CP models
Apache License 2.0
3 stars 0 forks source link

Repo of the CP22 paper:

Mohit Kumar, Samuel Kolb, Tias Guns: Learning Constraint Programming Models from Data Using Generate-And-Aggregate. CP 2022: 29:1-29:16

PDF available at: https://drops.dagstuhl.de/opus/volltexte/2022/16658/pdf/LIPIcs-CP-2022-29.pdf

For questions please contact Prof. Tias Guns

Paper history

We first created prototype code for the PTHG 21 Constraint Acquisition Challenge: https://freuder.wordpress.com/progress-towards-the-holy-grail-workshops/pthg-21-the-fifth-workshop-on-progress-towards-the-holy-grail/

We then refactored and extended the parts that we felt would make for an interesting paper. That is provided in this repo.

Requirements

The core part of CountCP (learn.py) uses the constraint solving library CPMpy. At submission time CPMpy was at v0.9.7, but it could be that we were using an older version.

I hope everything continues to work with the latest CPMpy version, if not let us know so we can fix it.

We also use the SymPy library for symbolic expressions.

Repo structure