| 2025 | ECAI | Post-Hoc Interpretation of POMDP Policies. | Geoffrey Laforest, Olivier Buffet, Alexandre Niveau, Bruno Zanuttini |
| 2024 | AAAI | Opponent-Model Search in Games with Incomplete Information. | Junkang Li, Bruno Zanuttini, Vronique Ventos |
| 2024 | IJCAI | Combinatorial Games with Incomplete Information. | Junkang Li, Bruno Zanuttini, Vronique Ventos |
| 2022 | IJCAI | Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values. | Junkang Li, Bruno Zanuttini, Tristan Cazenave, Vronique Ventos |
| 2018 | AAAI | An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty. | Florian Benavent, Bruno Zanuttini |
| 2018 | AAAI | Knowledge-Based Policies for Qualitative Decentralized POMDPs. | Abdallah Saffidine, Franois Schwarzentruber, Bruno Zanuttini |
| 2017 | ICDM | Online Learning of Acyclic Conditional Preference Networks from Noisy Data. | Fabien Labernia, Bruno Zanuttini, Brice Mayag, Florian Yger, Jamal Atif |
| 2016 | IJCAI | On Broken Triangles. | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini |
| 2016 | IJCAI | Efficient Representations for the Modal Logic S5. | Alexandre Niveau, Bruno Zanuttini |
| 2016 | ICTAI | Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback. | Esther Nicart, Bruno Zanuttini, Hugo Gilbert, Bruno Grilhres, Frderic Praca |
| 2016 | UAI | Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities. | Hugo Gilbert, Bruno Zanuttini, Paul Weng, Paolo Viappiani, Esther Nicart |
| 2015 | IJCAI | Probabilistic Knowledge-Based Programs. | Jrme Lang, Bruno Zanuttini |
| 2014 | CP | On Broken Triangles. | Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini |
| 2013 | CPAIOR | Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux, Bruno Zanuttini |
| 2013 | IJCAI | Interactive Value Iteration for Markov Decision Processes with Unknown Rewards. | Paul Weng, Bruno Zanuttini |
| 2013 | SODA | Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini |
| 2013 | UAI | Probabilistic Conditional Preference Networks. | Damien Bigot, Bruno Zanuttini, Hlne Fargier, Jrme Mengin |
| 2013 | TARK | Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. | Jrme Lang, Bruno Zanuttini |
| 2012 | ECAI | Knowledge-Based Programs as Plans - The Complexity of Plan Verification. | Jrme Lang, Bruno Zanuttini |
| 2012 | ISAIM | On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. | Achref El Mouelhi, Philippe Jgou, Cyril Terrioux, Bruno Zanuttini |
| 2009 | IJCAI | Making Bound Consistency as Effective as Arc Consistency. | Christian Bessiere, Thierry Petit, Bruno Zanuttini |
| 2009 | IJCAI | Learning Conditional Preference Networks with Queries. | Frdric Koriche, Bruno Zanuttini |
| 2006 | ECAI | Boolean Games Revisited. | Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jrme Lang, Bruno Zanuttini |
| 2005 | IJCAI | Propositional Abduction is Almost Always Hard. | Gustav Nordh, Bruno Zanuttini |
| 2004 | CADE | Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. | ngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini |
| 2002 | ECAI | Approximating Propositional Knowledge with Affine Formulas. | Bruno Zanuttini |