Bruno Zanuttini

71 papers A* 16A 10B 3Misc 1Journal 23Unranked 14
YearRankTypeTitle / Venue / Authors
2025 A conf
A Simple Integration of Epistemic Logic and Reinforcement Learning.
AAMAS
Thorsten Engesser, Thibaut Le Marre, Emiliano Lorini, François Schwarzentruber, Bruno Zanuttini
2025 — conf
Complexité des stratégies maxmin pures dans les jeux sous forme extensive à deux joueurs.
JIAF-JFPDA
Junkang Li, Bruno Zanuttini, Véronique Ventos
2025 A conf
Post-Hoc Interpretation of POMDP Policies.
ECAI
Geoffrey Laforest, Olivier Buffet, Alexandre Niveau, Bruno Zanuttini
2025 — conf
Post-Hoc Interpretation of POMDP Policies.
JIAF-JFPDA
Geoffrey Laforest, Olivier Buffet, Alexandre Niveau, Bruno Zanuttini
2025 — conf
Study of the Computational Complexity of the Repair Problem on Simple Temporal Networks with Uncertainty.
JIAF-JFPDA
Frédéric Maris, Aïdin Sumic, Thierry Vidal, Bruno Zanuttini
2025 J jnl
The Complexity of Pure Maxmin Strategies in Two-Player Extensive-Form Games.
J. Artif. Intell. Res.
Junkang Li, Bruno Zanuttini, Véronique Ventos
2024 J jnl
A knowledge compilation perspective on queries and transformations for belief tracking.
Ann. Math. Artif. Intell.
Alexandre Niveau, Héctor Palacios, Sergej Scheck, Bruno Zanuttini
2024 A* conf
Combinatorial Games with Incomplete Information.
IJCAI
Junkang Li, Bruno Zanuttini, Véronique Ventos
2024 — conf
Combinatorial Games with Incomplete Information.
JIAF-JFPDA
Junkang Li, Bruno Zanuttini, Véronique Ventos
2024 A* conf
Opponent-Model Search in Games with Incomplete Information.
AAAI
Junkang Li, Bruno Zanuttini, Véronique Ventos
2023 — conf
Opponent-model search in games with incomplete information.
JIAF
Junkang Li, Bruno Zanuttini, Véronique Ventos
2022 — conf
A KC Map for Variants of Nondeterministic PDDL.
JIAF
Sergej Scheck, Alexandre Niveau, Bruno Zanuttini
2022 A* conf
Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values.
IJCAI
Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos
2022 — conf
Generalisation of alpha-beta search for AND-OR graphs with partially ordered values.
JIAF
Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos
2021 A* conf
Knowledge Compilation for Nondeterministic Action Languages.
ICAPS
Sergej Scheck, Alexandre Niveau, Bruno Zanuttini
2020 J jnl
Knowledge-based programs as succinct policies for partially observable domains.
Artif. Intell.
Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine, François Schwarzentruber
2018 A* conf
An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty.
AAAI
Florian Benavent, Bruno Zanuttini
2018 A* conf
Knowledge-Based Policies for Qualitative Decentralized POMDPs.
AAAI
Abdallah Saffidine, François Schwarzentruber, Bruno Zanuttini
2017 J jnl
Amélioration continue d'une chaîne de traitement de documents avec l'apprentissage par renforcement.
Rev. d'Intelligence Artif.
Esther Nicart, Bruno Zanuttini, Bruno Grilhères, Patrick Giroux, Arnaud Saval
2017 A* conf
Online Learning of Acyclic Conditional Preference Networks from Noisy Data.
ICDM
Fabien Labernia, Bruno Zanuttini, Brice Mayag, Florian Yger, Jamal Atif
2017 J jnl
Strong partial clones and the time complexity of SAT problems.
J. Comput. Syst. Sci.
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2016 J jnl
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.
Artif. Intell.
Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini
2016 B conf
Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback.
ICTAI
Esther Nicart, Bruno Zanuttini, Hugo Gilbert, Bruno Grilhères, Frderic Praca
2016 A* conf
Efficient Representations for the Modal Logic S5.
IJCAI
Alexandre Niveau, Bruno Zanuttini
2016 A conf
Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities.
UAI
Hugo Gilbert, Bruno Zanuttini, Paul Weng, Paolo Viappiani, Esther Nicart
2016 A* conf
On Broken Triangles.
IJCAI
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
2015 — conf
Bounded Bases of Strong Partial Clones.
ISMVL
Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
2015 — conf
Continuous improvement of a document treatment chain using reinforcement learning.
IC
Esther Nicart, Bruno Zanuttini, Bruno Grilhères, Patrick Giroux
2015 A* conf
Probabilistic Knowledge-Based Programs.
IJCAI
Jérôme Lang, Bruno Zanuttini
2014 A conf
A study of sybil manipulations in hedonic games.
AAMAS
Thibaut Vallée, Grégory Bonnet, Bruno Zanuttini, François Bourdon
2014 — conf
Learning Probabilistic CP-nets from Observations of Optimal Items.
STAIRS
Damien Bigot, Jérôme Mengin, Bruno Zanuttini
2014 A conf
On Broken Triangles.
CP
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini
2013 J jnl
Application du problème de caractérisation multiple à la conception de tests de diagnostic pour la biologie végétale.
Rev. d'Intelligence Artif.
Fabien Chhel, Frédéric Lardeux, Frédéric Saubion, Bruno Zanuttini
2013 A* conf
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.
SODA
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2013 A* conf
Interactive Value Iteration for Markov Decision Processes with Unknown Rewards.
IJCAI
Paul Weng, Bruno Zanuttini
2013 J jnl
Introduction.
Rev. d'Intelligence Artif.
Bruno Zanuttini, Guillaume Laurent, Olivier Buffet
2013 B conf
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence.
TARK
Jérôme Lang, Bruno Zanuttini
2013 J jnl
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence.
CoRR
Jérôme Lang, Bruno Zanuttini
2013 A conf
Probabilistic Conditional Preference Networks.
UAI
Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin
2013 J jnl
Probabilistic Conditional Preference Networks.
CoRR
Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin
2013 B conf
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.
CPAIOR
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
2012 A conf
Knowledge-Based Programs as Plans - The Complexity of Plan Verification.
ECAI
Jérôme Lang, Bruno Zanuttini
2012 Misc conf
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
ISAIM
Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
2011 — book
Computational Aspects of Learning, Reasoning, and Deciding.
Bruno Zanuttini
2011 A* conf
Efficient Policy Construction for MDPs Represented in Probabilistic PDDL.
ICAPS
Boris Lesner, Bruno Zanuttini
2011 — conf
Handling Ambiguous Effects in Action Learning.
EWRL
Boris Lesner, Bruno Zanuttini
2011 J jnl
New Polynomial Classes for Logic-Based Abduction
CoRR
Bruno Zanuttini
2010 — ch.
Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets.
Preference Learning
Yann Chevaleyre, Frédéric Koriche, Jérôme Lang, Jérôme Mengin, Bruno Zanuttini
2010 J jnl
Learning conditional preference networks.
Artif. Intell.
Frédéric Koriche, Bruno Zanuttini
2010 — ch.
Nonredundant Generalized Rules and Their Impact in Classification.
Advances in Intelligent Information Systems
François Rioult, Bruno Zanuttini, Bruno Crémilleux
2010 J jnl
Résolution exacte et approchée de problèmes de décision markoviens formulés en logique propositionnelle.
Rev. d'Intelligence Artif.
Boris Lesner, Bruno Zanuttini
2009 J jnl
A note on some collapse results of valued constraints.
Inf. Process. Lett.
Bruno Zanuttini, Stanislav Zivný
2009 J jnl
Compact preference representation and Boolean games.
Auton. Agents Multi Agent Syst.
Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
2009 — conf
Frozen Boolean Partial Co-clones.
ISMVL
Gustav Nordh, Bruno Zanuttini
2009 A* conf
Learning Conditional Preference Networks with Queries.
IJCAI
Frédéric Koriche, Bruno Zanuttini
2009 A* conf
Making Bound Consistency as Effective as Arc Consistency.
IJCAI
Christian Bessiere, Thierry Petit, Bruno Zanuttini
2008 J jnl
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.
SIAM J. Comput.
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
2008 J jnl
Structure identification of Boolean relations and plain bases for co-clones.
J. Comput. Syst. Sci.
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
2008 J jnl
What makes propositional abduction tractable.
Artif. Intell.
Gustav Nordh, Bruno Zanuttini
2007 — conf
Specifying and Verifying a MAS: The Robots on MarsCase Study.
PROMAS
Bruno Mermet, Gaële Simon, Bruno Zanuttini, Arnaud Saval
2006 J jnl
A Complete Classification of the Complexity of Propositional Abduction.
SIAM J. Comput.
Nadia Creignou, Bruno Zanuttini
2006 A conf
Boolean Games Revisited.
ECAI
Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
2005 J jnl
Preferred representations of Boolean relations
Electron. Colloquium Comput. Complex.
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
2005 A* conf
Propositional Abduction is Almost Always Hard.
IJCAI
Gustav Nordh, Bruno Zanuttini
2004 A conf
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
IJCAR
Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
2003 — —
Acquisition de connaissances et raisonnement en logique propositionnelle.
Bruno Zanuttini
2003 J jnl
An efficient algorithm for Horn description.
Inf. Process. Lett.
Jean-Jacques Hébrard, Bruno Zanuttini
2003 J jnl
New Polynomial Classes for Logic-Based Abduction.
J. Artif. Intell. Res.
Bruno Zanuttini
2002 J jnl
A unified framework for structure identification.
Inf. Process. Lett.
Bruno Zanuttini, Jean-Jacques Hébrard
2002 A conf
Approximating Propositional Knowledge with Affine Formulas.
ECAI
Bruno Zanuttini
2002 — conf
Approximation of Relations by Propositional Formulas: Complexity and Semantics.
SARA
Bruno Zanuttini