Approximating Propositional Knowledge with Affine Formulas. - Bruno Zanuttini (ECAI, 2002)

Approximation of Relations by Propositional Formulas: Complexity and Semantics. - Bruno Zanuttini (SARA, 2002)

A unified framework for structure identification. - Bruno Zanuttini; Jean-Jacques Hébrard (Inf. Process. Lett., 2002)

An efficient algorithm for Horn description. - Jean-Jacques Hébrard; Bruno Zanuttini (Inf. Process. Lett., 2003)

New Polynomial Classes for Logic-Based Abduction. - Bruno Zanuttini (J. Artif. Intell. Res., 2003)

Acquisition de connaissances et raisonnement en logique propositionnelle. - Bruno Zanuttini (2003)

Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. - Àngel J. Gil; Miki Hermann; Gernot Salzer; Bruno Zanuttini (IJCAR, 2004)

Propositional Abduction is Almost Always Hard. - Gustav Nordh; Bruno Zanuttini (IJCAI, 2005)

Preferred representations of Boolean relations - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (Electron. Colloquium Comput. Complex., 2005)

Boolean Games Revisited. - Elise Bonzon; Marie-Christine Lagasquie-Schiex; Jérôme Lang; Bruno Zanuttini (ECAI, 2006)

A Complete Classification of the Complexity of Propositional Abduction. - Nadia Creignou; Bruno Zanuttini (SIAM J. Comput., 2006)

Specifying and Verifying a MAS: The Robots on MarsCase Study. - Bruno Mermet; Gaële Simon; Bruno Zanuttini; Arnaud Saval (PROMAS, 2007)

What makes propositional abduction tractable. - Gustav Nordh; Bruno Zanuttini (Artif. Intell., 2008)

Structure identification of Boolean relations and plain bases for co-clones. - Nadia Creignou; Phokion G. Kolaitis; Bruno Zanuttini (J. Comput. Syst. Sci., 2008)

Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. - Àngel J. Gil; Miki Hermann; Gernot Salzer; Bruno Zanuttini (SIAM J. Comput., 2008)

Making Bound Consistency as Effective as Arc Consistency. - Christian Bessiere; Thierry Petit; Bruno Zanuttini (IJCAI, 2009)

Learning Conditional Preference Networks with Queries. - Frédéric Koriche; Bruno Zanuttini (IJCAI, 2009)

Frozen Boolean Partial Co-clones. - Gustav Nordh; Bruno Zanuttini (ISMVL, 2009)

Compact preference representation and Boolean games. - Elise Bonzon; Marie-Christine Lagasquie-Schiex; Jérôme Lang; Bruno Zanuttini (Auton. Agents Multi Agent Syst., 2009)

A note on some collapse results of valued constraints. - Bruno Zanuttini; Stanislav Zivný (Inf. Process. Lett., 2009)

Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets. - Yann Chevaleyre; Frédéric Koriche; Jérôme Lang; Jérôme Mengin; Bruno Zanuttini (Preference Learning, 2010)

Learning conditional preference networks. - Frédéric Koriche; Bruno Zanuttini (Artif. Intell., 2010)

Résolution exacte et approchée de problèmes de décision markoviens formulés en logique propositionnelle. - Boris Lesner; Bruno Zanuttini (Rev. d'Intelligence Artif., 2010)

Nonredundant Generalized Rules and Their Impact in Classification. - François Rioult; Bruno Zanuttini; Bruno Crémilleux (Advances in Intelligent Information Systems, 2010)

Computational Aspects of Learning, Reasoning, and Deciding. - Bruno Zanuttini (2011)

Efficient Policy Construction for MDPs Represented in Probabilistic PDDL. - Boris Lesner; Bruno Zanuttini (ICAPS, 2011)

Handling Ambiguous Effects in Action Learning. - Boris Lesner; Bruno Zanuttini (EWRL, 2011)

Knowledge-Based Programs as Plans - The Complexity of Plan Verification. - Jérôme Lang; Bruno Zanuttini (ECAI, 2012)

On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux; Bruno Zanuttini (ISAIM, 2012)

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. - Achref El Mouelhi; Philippe Jégou; Cyril Terrioux; Bruno Zanuttini (CPAIOR, 2013)

Interactive Value Iteration for Markov Decision Processes with Unknown Rewards. - Paul Weng; Bruno Zanuttini (IJCAI, 2013)

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (SODA, 2013)

Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. - Jérôme Lang; Bruno Zanuttini (TARK, 2013)

Probabilistic Conditional Preference Networks. - Damien Bigot; Bruno Zanuttini; Hélène Fargier; Jérôme Mengin (UAI, 2013)

Application du problème de caractérisation multiple à la conception de tests de diagnostic pour la biologie végétale. - Fabien Chhel; Frédéric Lardeux; Frédéric Saubion; Bruno Zanuttini (Rev. d'Intelligence Artif., 2013)

Introduction. - Bruno Zanuttini; Guillaume Laurent; Olivier Buffet (Rev. d'Intelligence Artif., 2013)

A study of sybil manipulations in hedonic games. - Thibaut Vallée; Grégory Bonnet; Bruno Zanuttini; François Bourdon (AAMAS, 2014)

Learning Probabilistic CP-nets from Observations of Optimal Items. - Damien Bigot; Jérôme Mengin; Bruno Zanuttini (STAIRS, 2014)

Continuous improvement of a document treatment chain using reinforcement learning. - Esther Nicart; Bruno Zanuttini; Bruno Grilhères; Patrick Giroux (IC, 2015)

Probabilistic Knowledge-Based Programs. - Jérôme Lang; Bruno Zanuttini (IJCAI, 2015)

Bounded Bases of Strong Partial Clones. - Victor Lagerkvist; Magnus Wahlström; Bruno Zanuttini (ISMVL, 2015)

Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback. - Esther Nicart; Bruno Zanuttini; Hugo Gilbert; Bruno Grilhères; Frderic Praca (ICTAI, 2016)

On Broken Triangles. - Martin C. Cooper; Achref El Mouelhi; Cyril Terrioux; Bruno Zanuttini (IJCAI, 2016)

Efficient Representations for the Modal Logic S5. - Alexandre Niveau; Bruno Zanuttini (IJCAI, 2016)

Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities. - Hugo Gilbert; Bruno Zanuttini; Paul Weng; Paolo Viappiani; Esther Nicart (UAI, 2016)

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. - Martin C. Cooper; Aymeric Duchein; Achref El Mouelhi; Guillaume Escamocher; Cyril Terrioux; Bruno Zanuttini (Artif. Intell., 2016)

Online Learning of Acyclic Conditional Preference Networks from Noisy Data. - Fabien Labernia; Bruno Zanuttini; Brice Mayag; Florian Yger; Jamal Atif (ICDM, 2017)

Strong partial clones and the time complexity of SAT problems. - Peter Jonsson; Victor Lagerkvist; Gustav Nordh; Bruno Zanuttini (J. Comput. Syst. Sci., 2017)

Amélioration continue d'une chaîne de traitement de documents avec l'apprentissage par renforcement. - Esther Nicart; Bruno Zanuttini; Bruno Grilhères; Patrick Giroux; Arnaud Saval (Rev. d'Intelligence Artif., 2017)

An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty. - Florian Benavent; Bruno Zanuttini (AAAI, 2018)

Knowledge-Based Policies for Qualitative Decentralized POMDPs. - Abdallah Saffidine; François Schwarzentruber; Bruno Zanuttini (AAAI, 2018)

Knowledge-based programs as succinct policies for partially observable domains. - Bruno Zanuttini; Jérôme Lang; Abdallah Saffidine; François Schwarzentruber (Artif. Intell., 2020)

Knowledge Compilation for Nondeterministic Action Languages. - Sergej Scheck; Alexandre Niveau; Bruno Zanuttini (ICAPS, 2021)

Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values. - Junkang Li; Bruno Zanuttini; Tristan Cazenave; Véronique Ventos (IJCAI, 2022)

A KC Map for Variants of Nondeterministic PDDL. - Sergej Scheck; Alexandre Niveau; Bruno Zanuttini (JIAF, 2022)

Opponent-Model Search in Games with Incomplete Information. - Junkang Li; Bruno Zanuttini; Véronique Ventos (AAAI, 2024)

Combinatorial Games with Incomplete Information. - Junkang Li; Bruno Zanuttini; Véronique Ventos (IJCAI, 2024)

A knowledge compilation perspective on queries and transformations for belief tracking. - Alexandre Niveau; Héctor Palacios; Sergej Scheck; Bruno Zanuttini (Ann. Math. Artif. Intell., 2024)

A Simple Integration of Epistemic Logic and Reinforcement Learning. - Thorsten Engesser; Thibaut Le Marre; Emiliano Lorini; François Schwarzentruber; Bruno Zanuttini (AAMAS, 2025)

Post-Hoc Interpretation of POMDP Policies. - Geoffrey Laforest; Olivier Buffet; Alexandre Niveau; Bruno Zanuttini (JIAF-JFPDA, 2025)

Complexité des stratégies maxmin pures dans les jeux sous forme extensive à deux joueurs. - Junkang Li; Bruno Zanuttini; Véronique Ventos (JIAF-JFPDA, 2025)

Study of the Computational Complexity of the Repair Problem on Simple Temporal Networks with Uncertainty. - Frédéric Maris; Aïdin Sumic; Thierry Vidal; Bruno Zanuttini (JIAF-JFPDA, 2025)

The Complexity of Pure Maxmin Strategies in Two-Player Extensive-Form Games. - Junkang Li; Bruno Zanuttini; Véronique Ventos (J. Artif. Intell. Res., 2025)