Bruno Zanuttini

According to our database1, Bruno Zanuttini authored at least 56 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Opponent-model search in games with incomplete information.
Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

2022
A KC Map for Variants of Nondeterministic PDDL.
Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

Generalisation of alpha-beta search for AND-OR graphs with partially ordered values.
Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

2021
Knowledge Compilation for Nondeterministic Action Languages.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Knowledge-based programs as succinct policies for partially observable domains.
Artif. Intell., 2020

2018
Knowledge-Based Policies for Qualitative Decentralized POMDPs.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Amélioration continue d'une chaîne de traitement de documents avec l'apprentissage par renforcement.
Rev. d'Intelligence Artif., 2017

Strong partial clones and the time complexity of SAT problems.
J. Comput. Syst. Sci., 2017

Online Learning of Acyclic Conditional Preference Networks from Noisy Data.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.
Artif. Intell., 2016

Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Efficient Representations for the Modal Logic S5.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

2015
Bounded Bases of Strong Partial Clones.
Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

Probabilistic Knowledge-Based Programs.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Continuous improvement of a document treatment chain using reinforcement learning.
Proceedings of the IC 2015 : 26es Journées francophones d'Ingénierie des Connaissances (Proceedings of the 26th French Knowledge Engineering Conference), 2015

2014
Learning Probabilistic CP-nets from Observations of Optimal Items.
Proceedings of the STAIRS 2014, 2014

On Broken Triangles.
Proceedings of the Principles and Practice of Constraint Programming, 2014

A study of sybil manipulations in hedonic games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Introduction.
Rev. d'Intelligence Artif., 2013

Application du problème de caractérisation multiple à la conception de tests de diagnostic pour la biologie végétale.
Rev. d'Intelligence Artif., 2013

Probabilistic Conditional Preference Networks.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence.
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Interactive Value Iteration for Markov Decision Processes with Unknown Rewards.
Proceedings of the IJCAI 2013, 2013

Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Knowledge-Based Programs as Plans - The Complexity of Plan Verification.
Proceedings of the ECAI 2012, 2012

2011
Handling Ambiguous Effects in Action Learning.
Proceedings of the Recent Advances in Reinforcement Learning - 9th European Workshop, 2011

Efficient Policy Construction for MDPs Represented in Probabilistic PDDL.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Computational Aspects of Learning, Reasoning, and Deciding.
, 2011

2010
Nonredundant Generalized Rules and Their Impact in Classification.
Proceedings of the Advances in Intelligent Information Systems, 2010

Résolution exacte et approchée de problèmes de décision markoviens formulés en logique propositionnelle.
Rev. d'Intelligence Artif., 2010

Learning conditional preference networks.
Artif. Intell., 2010

Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets.
Proceedings of the Preference Learning., 2010

2009
A note on some collapse results of valued constraints.
Inf. Process. Lett., 2009

Compact preference representation and Boolean games.
Auton. Agents Multi Agent Syst., 2009

Frozen Boolean Partial Co-clones.
Proceedings of the ISMVL 2009, 2009

Learning Conditional Preference Networks with Queries.
Proceedings of the IJCAI 2009, 2009

Making Bound Consistency as Effective as Arc Consistency.
Proceedings of the IJCAI 2009, 2009

2008
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.
SIAM J. Comput., 2008

Structure identification of Boolean relations and plain bases for co-clones.
J. Comput. Syst. Sci., 2008

What makes propositional abduction tractable.
Artif. Intell., 2008

2007
Specifying and Verifying a MAS: The Robots on MarsCase Study.
Proceedings of the Programming Multi-Agent Systems, 5th International Workshop, 2007

2006
A Complete Classification of the Complexity of Propositional Abduction.
SIAM J. Comput., 2006

Boolean Games Revisited.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
Preferred representations of Boolean relations
Electron. Colloquium Comput. Complex., 2005

Propositional Abduction is Almost Always Hard.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
Acquisition de connaissances et raisonnement en logique propositionnelle.
PhD thesis, 2003

New Polynomial Classes for Logic-Based Abduction.
J. Artif. Intell. Res., 2003

An efficient algorithm for Horn description.
Inf. Process. Lett., 2003

2002
A unified framework for structure identification.
Inf. Process. Lett., 2002

Approximation of Relations by Propositional Formulas: Complexity and Semantics.
Proceedings of the Abstraction, 2002

Approximating Propositional Knowledge with Affine Formulas.
Proceedings of the 15th European Conference on Artificial Intelligence, 2002


  Loading...