 | 2009 |
|---|
| 12 |       | Luca Pulina,
Armando Tacchella:
Hard QBF Encodings Made Easy: Dream or Reality?
AI*IA 2009: 31-41 |
| 11 | | Luca Pulina,
Armando Tacchella:
Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas.
FroCos 2009: 350-365 |
| 10 | | Luca Pulina,
Armando Tacchella:
A Structural Approach to Reasoning with Quantified Boolean Formulas.
IJCAI 2009: 596-602 |
| 9 | | Roman Kontchakov,
Luca Pulina,
Ulrike Sattler,
Thomas Schneider,
Petra Selmer,
Frank Wolter,
Michael Zakharyaschev:
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers.
IJCAI 2009: 836-841 |
| 8 | | Luca Pulina,
Armando Tacchella:
A self-adaptive multi-engine solver for quantified Boolean formulas.
Constraints 14(1): 80-116 (2009) |
| 2008 |
|---|
| 7 | | Luca Pulina,
Armando Tacchella:
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings.
LPAR 2008: 528-542 |
| 6 | | Luca Pulina,
Armando Tacchella:
QuBIS: An (In)complete Solver for Quantified Boolean Formulas.
MICAI 2008: 34-43 |
| 2007 |
|---|
| 5 | | Massimo Narizzano,
Luca Pulina,
Armando Tacchella:
Ranking and Reputation Systems in the QBF Competition.
AI*IA 2007: 97-108 |
| 4 | | Luca Pulina,
Armando Tacchella:
A Multi-engine Solver for Quantified Boolean Formulas.
CP 2007: 574-589 |
| 2006 |
|---|
| 3 | | Massimo Narizzano,
Luca Pulina,
Armando Tacchella:
The QBFEVAL Web Portal.
JELIA 2006: 494-497 |
| 2 |  | Luca Pulina:
Empirical Evaluation of Scoring Methods.
STAIRS 2006: 108-119 |
| 1 | | Massimo Narizzano,
Luca Pulina,
Armando Tacchella:
Report of the Third QBF Solvers Evaluation.
JSAT 2(1-4): 145-164 (2006) |
