default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Zanuttini
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Alexandre Niveau, Héctor Palacios, Sergej Scheck, Bruno Zanuttini
:
A knowledge compilation perspective on queries and transformations for belief tracking. Ann. Math. Artif. Intell. 92(5): 1113-1159 (2024)- [c39]Junkang Li, Bruno Zanuttini, Véronique Ventos:
Opponent-Model Search in Games with Incomplete Information. AAAI 2024: 9840-9847 - [c38]Junkang Li, Bruno Zanuttini, Véronique Ventos:
Combinatorial Games with Incomplete Information. IJCAI 2024: 2895-2903 - [c37]Junkang Li, Bruno Zanuttini, Véronique Ventos:
Combinatorial Games with Incomplete Information. JIAF-JFPDA 2024: 171-180 - 2023
- [c36]Junkang Li, Bruno Zanuttini, Véronique Ventos:
Opponent-model search in games with incomplete information. JIAF 2023: 221-232 - 2022
- [c35]Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos:
Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values. IJCAI 2022: 4769-4775 - [c34]Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos:
Generalisation of alpha-beta search for AND-OR graphs with partially ordered values. JIAF 2022: 89-99 - [c33]Sergej Scheck, Alexandre Niveau, Bruno Zanuttini:
A KC Map for Variants of Nondeterministic PDDL. JIAF 2022: 100-109 - 2021
- [c32]Sergej Scheck, Alexandre Niveau, Bruno Zanuttini:
Knowledge Compilation for Nondeterministic Action Languages. ICAPS 2021: 308-316 - 2020
- [j17]Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine, François Schwarzentruber:
Knowledge-based programs as succinct policies for partially observable domains. Artif. Intell. 288: 103365 (2020)
2010 – 2019
- 2018
- [c31]Abdallah Saffidine, François Schwarzentruber, Bruno Zanuttini:
Knowledge-Based Policies for Qualitative Decentralized POMDPs. AAAI 2018: 6270-6277 - [c30]Florian Benavent, Bruno Zanuttini:
An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty. AAAI 2018: 6319-6326 - 2017
- [j16]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84: 52-78 (2017) - [j15]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): 619-618 (2017) - [c29]Fabien Labernia, Bruno Zanuttini, Brice Mayag, Florian Yger, Jamal Atif:
Online Learning of Acyclic Conditional Preference Networks from Noisy Data. ICDM 2017: 247-256 - 2016
- [j14]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: 196-218 (2016) - [c28]Esther Nicart, Bruno Zanuttini, Hugo Gilbert, Bruno Grilhères, Frderic Praca:
Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback. ICTAI 2016: 635-639 - [c27]Alexandre Niveau, Bruno Zanuttini:
Efficient Representations for the Modal Logic S5. IJCAI 2016: 1223-1229 - [c26]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. IJCAI 2016: 4135-4139 - [c25]Hugo Gilbert, Bruno Zanuttini, Paul Weng, Paolo Viappiani, Esther Nicart:
Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities. UAI 2016 - 2015
- [c24]Esther Nicart, Bruno Zanuttini, Bruno Grilhères, Patrick Giroux:
Continuous improvement of a document treatment chain using reinforcement learning. IC 2015 - [c23]Jérôme Lang, Bruno Zanuttini:
Probabilistic Knowledge-Based Programs. IJCAI 2015: 1594-1600 - [c22]Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini:
Bounded Bases of Strong Partial Clones. ISMVL 2015: 189-194 - 2014
- [c21]Thibaut Vallée, Grégory Bonnet, Bruno Zanuttini, François Bourdon:
A study of sybil manipulations in hedonic games. AAMAS 2014: 21-28 - [c20]Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini:
On Broken Triangles. CP 2014: 9-24 - [c19]Damien Bigot, Jérôme Mengin, Bruno Zanuttini:
Learning Probabilistic CP-nets from Observations of Optimal Items. STAIRS 2014: 81-90 - 2013
- [j13]Bruno Zanuttini, Guillaume Laurent, Olivier Buffet:
Introduction. Rev. d'Intelligence Artif. 27(2): 153-154 (2013) - [j12]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): 649-668 (2013) - [c18]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. CPAIOR 2013: 61-76 - [c17]Paul Weng, Bruno Zanuttini:
Interactive Value Iteration for Markov Decision Processes with Unknown Rewards. IJCAI 2013: 2415-2421 - [c16]Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA 2013: 1264-1277 - [c15]Jérôme Lang, Bruno Zanuttini:
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. TARK 2013 - [c14]Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin:
Probabilistic Conditional Preference Networks. UAI 2013 - [i4]Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin:
Probabilistic Conditional Preference Networks. CoRR abs/1309.6817 (2013) - [i3]Jérôme Lang, Bruno Zanuttini:
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. CoRR abs/1310.6429 (2013) - 2012
- [c13]Jérôme Lang, Bruno Zanuttini:
Knowledge-Based Programs as Plans - The Complexity of Plan Verification. ECAI 2012: 504-509 - [c12]Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini:
On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. ISAIM 2012 - 2011
- [b2]Bruno Zanuttini:
Computational Aspects of Learning, Reasoning, and Deciding. University of Caen Normandy, France, 2011 - [c11]Boris Lesner, Bruno Zanuttini:
Efficient Policy Construction for MDPs Represented in Probabilistic PDDL. ICAPS 2011 - [c10]Boris Lesner, Bruno Zanuttini:
Handling Ambiguous Effects in Action Learning. EWRL 2011: 54-65 - [i2]Bruno Zanuttini:
New Polynomial Classes for Logic-Based Abduction. CoRR abs/1106.5263 (2011) - 2010
- [j11]Frédéric Koriche, Bruno Zanuttini:
Learning conditional preference networks. Artif. Intell. 174(11): 685-703 (2010) - [j10]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): 131-158 (2010) - [p2]Yann Chevaleyre, Frédéric Koriche, Jérôme Lang, Jérôme Mengin, Bruno Zanuttini:
Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets. Preference Learning 2010: 273-296 - [p1]François Rioult, Bruno Zanuttini, Bruno Crémilleux:
Nonredundant Generalized Rules and Their Impact in Classification. Advances in Intelligent Information Systems 2010: 3-25
2000 – 2009
- 2009
- [j9]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): 1-35 (2009) - [j8]Bruno Zanuttini, Stanislav Zivný:
A note on some collapse results of valued constraints. Inf. Process. Lett. 109(11): 534-538 (2009) - [c9]Christian Bessiere, Thierry Petit, Bruno Zanuttini:
Making Bound Consistency as Effective as Arc Consistency. IJCAI 2009: 425-430 - [c8]Frédéric Koriche, Bruno Zanuttini:
Learning Conditional Preference Networks with Queries. IJCAI 2009: 1930-1935 - [c7]Gustav Nordh, Bruno Zanuttini:
Frozen Boolean Partial Co-clones. ISMVL 2009: 120-125 - 2008
- [j7]Gustav Nordh, Bruno Zanuttini:
What makes propositional abduction tractable. Artif. Intell. 172(10): 1245-1284 (2008) - [j6]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Structure identification of Boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74(7): 1103-1115 (2008) - [j5]Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini:
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. SIAM J. Comput. 38(3): 922-945 (2008) - 2007
- [c6]Bruno Mermet, Gaële Simon, Bruno Zanuttini, Arnaud Saval:
Specifying and Verifying a MAS: The Robots on MarsCase Study. PROMAS 2007: 172-189 - 2006
- [j4]Nadia Creignou, Bruno Zanuttini:
A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006) - [c5]Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini:
Boolean Games Revisited. ECAI 2006: 265-269 - 2005
- [c4]Gustav Nordh, Bruno Zanuttini:
Propositional Abduction is Almost Always Hard. IJCAI 2005: 534-539 - [i1]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini:
Preferred representations of Boolean relations. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c3]Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini:
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. IJCAR 2004: 244-258 - 2003
- [b1]Bruno Zanuttini:
Acquisition de connaissances et raisonnement en logique propositionnelle. University of Caen Normandy, France, 2003 - [j3]Jean-Jacques Hébrard, Bruno Zanuttini:
An efficient algorithm for Horn description. Inf. Process. Lett. 88(4): 177-182 (2003) - [j2]Bruno Zanuttini:
New Polynomial Classes for Logic-Based Abduction. J. Artif. Intell. Res. 19: 1-10 (2003) - 2002
- [j1]Bruno Zanuttini, Jean-Jacques Hébrard:
A unified framework for structure identification. Inf. Process. Lett. 81(6): 335-339 (2002) - [c2]Bruno Zanuttini:
Approximating Propositional Knowledge with Affine Formulas. ECAI 2002: 287-291 - [c1]Bruno Zanuttini:
Approximation of Relations by Propositional Formulas: Complexity and Semantics. SARA 2002: 242-255
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
