| 2008 |
|---|
| 5 | EE | Paulo J. Matos,
Jordi Planes,
Florian Letombe,
João Marques-Silva:
A MAX-SAT Algorithm Portfolio.
ECAI 2008: 911-912 |
| 4 | EE | Florian Letombe,
João Marques-Silva:
Improvements to Hybrid Incremental SAT Algorithms.
SAT 2008: 168-181 |
| 2006 |
|---|
| 3 | EE | Sylvie Coste-Marquis,
Daniel Le Berre,
Florian Letombe,
Pierre Marquis:
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.
JSAT 1(1): 61-88 (2006) |
| 2005 |
|---|
| 2 | | Sylvie Coste-Marquis,
Daniel Le Berre,
Florian Letombe,
Pierre Marquis:
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae.
AAAI 2005: 288-293 |
| 1 | EE | Sylvie Coste-Marquis,
Daniel Le Berre,
Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas.
SAT 2005: 393-399 |
