dblp.uni-trier.dewww.uni-trier.de

Bruno Zanuttini Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
18EEFrédéric Koriche, Bruno Zanuttini: Learning Conditional Preference Networks with Queries. IJCAI 2009: 1930-1935
17EEChristian Bessiere, Thierry Petit, Bruno Zanuttini: Making Bound Consistency as Effective as Arc Consistency. IJCAI 2009: 425-430
16EEElise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini: Compact preference representation and Boolean games. Autonomous Agents and Multi-Agent Systems 18(1): 1-35 (2009)
15EEBruno Zanuttini, Stanislav Zivný: A note on some collapse results of valued constraints. Inf. Process. Lett. 109(11): 534-538 (2009)
2008
14EEGustav Nordh, Bruno Zanuttini: What makes propositional abduction tractable. Artif. Intell. 172(10): 1245-1284 (2008)
13EENadia 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)
12EEÀ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
11EEBruno Mermet, Gaële Simon, Bruno Zanuttini, Arnaud Saval: Specifying and Verifying a MAS: The Robots on MarsCase Study. PROMAS 2007: 172-189
2006
10 Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini: Boolean Games Revisited. ECAI 2006: 265-269
9EENadia Creignou, Bruno Zanuttini: A Complete Classification of the Complexity of Propositional Abduction. SIAM J. Comput. 36(1): 207-229 (2006)
2005
8EEGustav Nordh, Bruno Zanuttini: Propositional Abduction is Almost Always Hard. IJCAI 2005: 534-539
7EENadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations Electronic Colloquium on Computational Complexity (ECCC)(119): (2005)
2004
6EEÀ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
5EEJean-Jacques Hébrard, Bruno Zanuttini: An efficient algorithm for Horn description. Inf. Process. Lett. 88(4): 177-182 (2003)
4EEBruno Zanuttini: New Polynomial Classes for Logic-Based Abduction. J. Artif. Intell. Res. (JAIR) 19: 1-10 (2003)
2002
3 Bruno Zanuttini: Approximating Propositional Knowledge with Affine Formulas. ECAI 2002: 287-291
2EEBruno Zanuttini: Approximation of Relations by Propositional Formulas: Complexity and Semantics. SARA 2002: 242-255
1EEBruno Zanuttini, Jean-Jacques Hébrard: A unified framework for structure identification. Inf. Process. Lett. 81(6): 335-339 (2002)

Coauthor Index

1Christian Bessiere (Christian Bessière) [17]
2Elise Bonzon [10] [16]
3Nadia Creignou [7] [9] [13]
4Àngel J. Gil [6] [12]
5Jean-Jacques Hébrard [1] [5]
6Miki Hermann [6] [12]
7Phokion G. Kolaitis [7] [13]
8Frédéric Koriche [18]
9Marie-Christine Lagasquie-Schiex [10] [16]
10Jérôme Lang [10] [16]
11Bruno Mermet [11]
12Gustav Nordh [8] [14]
13Thierry Petit [17]
14Gernot Salzer [6] [12]
15Arnaud Saval [11]
16Gaële Simon [11]
17Stanislav Zivný [15]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)