Combining Nogoods in Restart-Based Search. - Gael Glorian; Frédéric Boussemart; Jean-Marie Lagniez; Christophe Lecoutre; Bertrand Mazure (CP, 2017)

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Michael Sioutis (CP, 2018)

An Incremental SAT-Based Approach to the Graph Colouring Problem. - Gael Glorian; Jean-Marie Lagniez; Valentin Montmirail; Nicolas Szczepanski (CP, 2019)

Hybridation de techniques d'apprentissage de clauses en programmation par contraintes. (Hybridization of clause learning techniques in constraint programming). - Gael Glorian (2019)

NACRE - A Nogood And Clause Reasoning Engine. - Gael Glorian; Jean-Marie Lagniez; Christophe Lecoutre (LPAR, 2020)

The Dungeon Variations Problem Using Constraint Programming. - Gaël Glorian; Adrien Debesson; Sylvain Yvon-Paliot; Laurent Simon 001 (CP, 2021)

A Deep Reinforcement Learning Heuristic for SAT based on Antagonist Graph Neural Networks. - Thomas Fournier; Arnaud Lallouet; Télio Cropsal; Gaël Glorian; Alexandre Papadopoulos; Antoine Petitet; Guillaume Perez; Suruthy Sekar; Wijnand Suijlen (ICTAI, 2022)

Generalized Confidence Constraints. - Guillaume Perez; Steve Malalel; Gael Glorian; Victor Jung; Alexandre Papadopoulos; Marie Pelleau; Wijnand Suijlen; Jean-Charles Régin; Arnaud Lallouet (AAAI, 2023)

Distribution Optimization in Constraint Programming. - Guillaume Perez; Gaël Glorian; Wijnand Suijlen; Arnaud Lallouet (CP, 2023)

A Constraint Programming Model for Scheduling the Unloading of Trains in Ports. - Guillaume Perez; Gaël Glorian; Wijnand Suijlen; Arnaud Lallouet (ICTAI, 2023)

A Constraint Programming Model for Scheduling the Unloading of Trains in Ports: Extended. - Guillaume Perez; Gael Glorian; Wijnand Suijlen; Arnaud Lallouet (CoRR, 2023)

Lazy ad hoc Explanations for the Sum Constraint. - Suruthy Sekar; Gaël Glorian; Wijnand Suijlen; Éric Monfroy; Arnaud Lallouet (ICTAI, 2024)