The SCEAS System
Navigation Menu

Search the dblp DataBase


Bruno Zanuttini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Àngel J. Gil, Miki Hermann, Gernot Salzer, Bruno Zanuttini
    Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:244-258 [Conf]
  2. Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini
    Boolean Games Revisited. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:265-269 [Conf]
  3. Bruno Zanuttini
    Approximating Propositional Knowledge with Affine Formulas. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:287-291 [Conf]
  4. Gustav Nordh, Bruno Zanuttini
    Propositional Abduction is Almost Always Hard. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:534-539 [Conf]
  5. Bruno Zanuttini
    Approximation of Relations by Propositional Formulas: Complexity and Semantics. [Citation Graph (0, 0)][DBLP]
    SARA, 2002, pp:242-255 [Conf]
  6. Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini
    Preferred representations of Boolean relations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:119, pp:- [Journal]
  7. Jean-Jacques Hébrard, Bruno Zanuttini
    An efficient algorithm for Horn description. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:4, pp:177-182 [Journal]
  8. Bruno Zanuttini, Jean-Jacques Hébrard
    A unified framework for structure identification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:6, pp:335-339 [Journal]
  9. Bruno Zanuttini
    New Polynomial Classes for Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2003, v:19, n:, pp:1-10 [Journal]
  10. Nadia Creignou, Bruno Zanuttini
    A Complete Classification of the Complexity of Propositional Abduction. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:207-229 [Journal]

  11. Making Bound Consistency as Effective as Arc Consistency. [Citation Graph (, )][DBLP]

  12. Learning Conditional Preference Networks with Queries. [Citation Graph (, )][DBLP]

  13. Frozen Boolean Partial Co-clones. [Citation Graph (, )][DBLP]

  14. Specifying and Verifying a MAS: The Robots on MarsCase Study. [Citation Graph (, )][DBLP]

  15. Compact preference representation and Boolean games. [Citation Graph (, )][DBLP]

  16. What makes propositional abduction tractable. [Citation Graph (, )][DBLP]

  17. Learning conditional preference networks. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002