Techniques for reducing the complexity of algorithms to solve problems with uncertainty and preferences
Chair objectives
Knowledge compilation is a family of approaches for addressing the
intractability of a number of difficult problems (beyond NP). A problem instance is "compiled" (pre
processed, typically transformed into an instance of another language) in an off-line phase in order to support the pertinent requests in polytime.
The aim of the ANITI KC project is to draw compilation maps (roughly, comparative complexity analyses), and to develop and experiment compilation models and algorithms for the on-line optimization of problems dealing with preferences and/or uncertainties, be the
uncertainty/preference model quantitative (e.g. GAI nets, Bayesian nets, Temporal CSPs) or qualitative (e.g. CP nets, logical approaches, point and interval algebra). Our domain of application includes temporal planning problems, configuration problems, and game theory.
Program Certifiable AI
Theme Automated reasoning and decision making
Chair holder : Hélène Fargier, DR CNRS, IRIT
Co-chairs:
- Christian Artigues (CNRS, LAAS)
- Romain Guillaume (UT2J, IRIT)
- Jérôme Mengin (UT3,IRIT), C.dric Pralet (ONERA)
Chair holder : Hélène Fargier, CNRS
Co- chairs :
- Christian Artigues (CNRS, LAAS)
- Romain Guillaume (UT2J, IRIT)
- Jérôme Mengin (UT3, IRIT), C.dric Pralet (ONERA)
Senior collaborating researchers
- Florent Teichteil-Konigsbuch (Airbus),
- Guillaume Poveda (Airbus) – Forthcoming
Doctorants
- Louis Riviere, since July 2020
- Hieu Tran Tron, since January 2021 Forthcoming joint Ph. D with ISAE/EMAC (E. Vareille/P. Gaborit), not funded by ANITI
Post-docs
- Nicolas Schmidt, since February 2020
Evénements organisés
- International autumn school on Constraint Programming, Combinatorial Optimization and Machine
- Learning (ACP – ANITI- GDR RO and IA
- [AAMAS21] Hélène Fargier, Jérôme Mengin: A Knowledge Compilation Map for Conditional Preference Statements-based Languages. AAMAS 2021: 492-500
- [DAM19] Margaux Nattaf, Mark. Horv.th, Tam.s Kis, Christian Artigues, Pierre Lopez. Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem. Discrete Applied Mathematics, Elsevier, 2019, 258, pp.188-203.
- [ECSQARU21] Hélène Fargier, Erik Martin-Dorel, Pierre Pommeret-Coquot. Games of Incomplete Information: a Framework Based on Belief Functions. ECSQARU 21 (accepted)
- [Fuzz’IEEE20] Romain Guillaume, Adam Kasperski, Pawel Zielinski: Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty. FUZZ-IEEE 2020: 1-8
- [Fuzz’IEEE21a] Guillaume, R., Kasperski, A., & Zieliński, P. Robust possibilistic optimization with copula function (accepted)
- [Fuzz’IEEE21b] Guillaume, R., Kasperski, A., & Zieliński, P. Robust optimization with scenarios using belief functions (accepted).
- [ICORE21a] Christian Artigues, Emmanuel H.brard, Alain Quilliot, H.l.ne Toussaint. Multi-Mode RCPSP with Safety Margin Maximization: Models and Algorithms. 10th International Conference on Operations Research and Enterprise Systems, Feb 2021, Online Streaming, Austria. pp.129-136.
- [ICORE21b] Louis Rivi.re, Christian Artigues, Azeddine Cheref, Nicolas Jozefowiez, Marie-Jos. Huguet, Sandra Ulrich Ngueveu, Vincent Charvillat Multi-product, Multi-supplier Order Assignment and Routing for an e- Commerce Application in the Retail Sector 10th International Conference on Operations Research and Enterprise Systems, Feb 2021, Austria. pp.438-445.
- [IJAR 20] Hélène Fargier, Romain Guillaume: Sequential decision making under ordinal uncertainty: A qualitative alternative to the Hurwicz criterion. Int. J. Approx. Reason. 116: 1-18 (2020).
- [IJPR20] Oliver Polo Mejia, Christian Artigues, Pierre Lopez, Virginie Basini. Mixed-integer/linear and constraint programming approaches for activity scheduling in a nuclear research facility, International Journal of Production Research, Taylor & Francis, 2020, 58 (23), pp.7149-7166.
- [IPMU20] Tom Portoleau, Christian Artigues, Romain Guillaume: Robust Predictive-Reactive Scheduling: An Information-Based Decision Tree Model. IPMU 2020: 479-492
- [MDAI’21] Didier Dubois, Hh.l.ne Fargier, Romain Guillaume,Agnes Rico. Sequential decision- making under uncertainty using hybrid probability-possibility functions. MDAI’21 (accepted)
- [KR20] Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi: Ordinal Polymatrix Games with Incomplete Information. KR 2020: 99-108
- [ROADEF21a] Louis Rivière.Two-stage stochastic/robust scheduling using permutable operation groups: a constraint programming approach. ROADEF’21.
- [ROADEF21b] Trong-Hieu Tran. Hybridation entre recherche incomplète et apprentissage de conflits pour un problème de routage avec sélection de clients. ROADEF’21.
- [TR20] Yun He, Christian Artigues, Cyril Briand, Nicolas Jozefowiez, Sandra Ulrich Ngueveu. A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem, Transportation Science, 2020, 54 (2), pp.355-374
Know more
Computer-assisted choice, with Hélène Fargier
Curious, Hélène Fargier is interested in ideas and projects as much as she enjoys meeting people to compare her points of view. An open attitude that she also adopts in matters of artificial intelligence, in her role as chair holder.