Bruno Zanuttini

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 17

Top Venues

IJCAI

AAAI

JIAF

Artif. Intell.

University of Caen Normandy, France (PHD)

Education History

University of Caen Normandy, France

PHD

Publications

Junkang Li, Bruno Zanuttini, Véronique Ventos
Opponent-Model Search in Games with Incomplete Information. AAAI (2024)
Junkang Li, Bruno Zanuttini, Véronique Ventos
Opponent-model search in games with incomplete information. JIAF (2023)
Sergej Scheck, Alexandre Niveau, Bruno Zanuttini
A KC Map for Variants of Nondeterministic PDDL. JIAF (2022)
Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos
Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values. IJCAI (2022)
Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos
Generalisation of alpha-beta search for AND-OR graphs with partially ordered values. JIAF (2022)
Sergej Scheck, Alexandre Niveau, Bruno Zanuttini
Knowledge Compilation for Nondeterministic Action Languages. ICAPS (2021)
Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine, François Schwarzentruber
Knowledge-based programs as succinct policies for partially observable domains. Artif. Intell. 288 (2020)
Florian Benavent, Bruno Zanuttini
An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty. AAAI (2018)
Abdallah Saffidine, François Schwarzentruber, Bruno Zanuttini
Knowledge-Based Policies for Qualitative Decentralized POMDPs. AAAI (2018)
Fabien Labernia, Bruno Zanuttini, Brice Mayag, Florian Yger, Jamal Atif
Online Learning of Acyclic Conditional Preference Networks from Noisy Data. ICDM (2017)
Esther Nicart, Bruno Zanuttini, Bruno Grilhères, Patrick Giroux, Arnaud Saval
Amélioration continue d'une chaîne de traitement de documents avec l'apprentissage par renforcement. Rev. d'Intelligence Artif. 31 (6) (2017)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84 (2017)
Esther Nicart, Bruno Zanuttini, Hugo Gilbert, Bruno Grilhères, Frderic Praca
Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback. ICTAI (2016)
Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234 (2016)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
On Broken Triangles. IJCAI (2016)
Hugo Gilbert, Bruno Zanuttini, Paul Weng, Paolo Viappiani, Esther Nicart
Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities. UAI (2016)
Alexandre Niveau, Bruno Zanuttini
Efficient Representations for the Modal Logic S5. IJCAI (2016)
Jérôme Lang, Bruno Zanuttini
Probabilistic Knowledge-Based Programs. IJCAI (2015)
Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
Bounded Bases of Strong Partial Clones. ISMVL (2015)
Esther Nicart, Bruno Zanuttini, Bruno Grilhères, Patrick Giroux
Continuous improvement of a document treatment chain using reinforcement learning. IC (2015)
Damien Bigot, Jérôme Mengin, Bruno Zanuttini
Learning Probabilistic CP-nets from Observations of Optimal Items. STAIRS (2014)
Thibaut Vallée, Grégory Bonnet, Bruno Zanuttini, François Bourdon
A study of sybil manipulations in hedonic games. AAMAS (2014)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
On Broken Triangles. CP (2014)
Jérôme Lang, Bruno Zanuttini
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. CoRR (2013)
Fabien Chhel, Frédéric Lardeux, Frédéric Saubion, Bruno Zanuttini
Application du problème de caractérisation multiple à la conception de tests de diagnostic pour la biologie végétale. Rev. d'Intelligence Artif. 27 (4-5) (2013)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR (2013)
Bruno Zanuttini, Guillaume Laurent, Olivier Buffet
Introduction. Rev. d'Intelligence Artif. 27 (2) (2013)
Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin
Probabilistic Conditional Preference Networks. CoRR (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA (2013)
Jérôme Lang, Bruno Zanuttini
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. TARK (2013)
Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin
Probabilistic Conditional Preference Networks. UAI (2013)
Paul Weng, Bruno Zanuttini
Interactive Value Iteration for Markov Decision Processes with Unknown Rewards. IJCAI (2013)
Jérôme Lang, Bruno Zanuttini
Knowledge-Based Programs as Plans - The Complexity of Plan Verification. ECAI (2012)
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM (2012)
Boris Lesner, Bruno Zanuttini
Efficient Policy Construction for MDPs Represented in Probabilistic PDDL. ICAPS (2011)
Boris Lesner, Bruno Zanuttini
Handling Ambiguous Effects in Action Learning. EWRL (2011)
Bruno Zanuttini
New Polynomial Classes for Logic-Based Abduction CoRR (2011)
Boris Lesner, Bruno Zanuttini
Résolution exacte et approchée de problèmes de décision markoviens formulés en logique propositionnelle. Rev. d'Intelligence Artif. 24 (2) (2010)
Frédéric Koriche, Bruno Zanuttini
Learning conditional preference networks. Artif. Intell. 174 (11) (2010)
Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
Compact preference representation and Boolean games. Auton. Agents Multi Agent Syst. 18 (1) (2009)
Bruno Zanuttini, Stanislav Zivný
A note on some collapse results of valued constraints. Inf. Process. Lett. 109 (11) (2009)
Gustav Nordh, Bruno Zanuttini
Frozen Boolean Partial Co-clones. ISMVL (2009)
Christian Bessiere, Thierry Petit, Bruno Zanuttini
Making Bound Consistency as Effective as Arc Consistency. IJCAI (2009)
Frédéric Koriche, Bruno Zanuttini
Learning Conditional Preference Networks with Queries. IJCAI (2009)
Gustav Nordh, Bruno Zanuttini
What makes propositional abduction tractable. Artif. Intell. 172 (10) (2008)
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74 (7) (2008)
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. SIAM J. Comput. 38 (3) (2008)
Bruno Mermet, Gaële Simon, Bruno Zanuttini, Arnaud Saval
Specifying and Verifying a MAS: The Robots on MarsCase Study. PROMAS (2007)
Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
Boolean Games Revisited. ECAI (2006)
Nadia Creignou, Bruno Zanuttini
A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36 (1) (2006)
Gustav Nordh, Bruno Zanuttini
Propositional Abduction is Almost Always Hard. IJCAI (2005)
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
Preferred representations of Boolean relations Electron. Colloquium Comput. Complex. (119) (2005)
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. IJCAR (2004)
Bruno Zanuttini
New Polynomial Classes for Logic-Based Abduction. J. Artif. Intell. Res. 19 (2003)
Jean-Jacques Hébrard, Bruno Zanuttini
An efficient algorithm for Horn description. Inf. Process. Lett. 88 (4) (2003)
Bruno Zanuttini
Approximation of Relations by Propositional Formulas: Complexity and Semantics. SARA (2002)
Bruno Zanuttini, Jean-Jacques Hébrard
A unified framework for structure identification. Inf. Process. Lett. 81 (6) (2002)
Bruno Zanuttini
Approximating Propositional Knowledge with Affine Formulas. ECAI (2002)

Bruno Zanuttini.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bruno Zanuttini