2008 |
14 | EE | Gustav Nordh,
Bruno Zanuttini:
What makes propositional abduction tractable.
Artif. Intell. 172(10): 1245-1284 (2008) |
13 | EE | 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) |
12 | EE | À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 |
11 | EE | Bruno 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 |
9 | EE | Nadia Creignou,
Bruno Zanuttini:
A Complete Classification of the Complexity of Propositional Abduction.
SIAM J. Comput. 36(1): 207-229 (2006) |
2005 |
8 | EE | Gustav Nordh,
Bruno Zanuttini:
Propositional Abduction is Almost Always Hard.
IJCAI 2005: 534-539 |
7 | EE | Nadia Creignou,
Phokion G. Kolaitis,
Bruno Zanuttini:
Preferred representations of Boolean relations
Electronic Colloquium on Computational Complexity (ECCC)(119): (2005) |
2004 |
6 | EE | À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 |
5 | EE | Jean-Jacques Hébrard,
Bruno Zanuttini:
An efficient algorithm for Horn description.
Inf. Process. Lett. 88(4): 177-182 (2003) |
4 | EE | Bruno 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 |
2 | EE | Bruno Zanuttini:
Approximation of Relations by Propositional Formulas: Complexity and Semantics.
SARA 2002: 242-255 |
1 | EE | Bruno Zanuttini,
Jean-Jacques Hébrard:
A unified framework for structure identification.
Inf. Process. Lett. 81(6): 335-339 (2002) |