PULINA, LUCA
PULINA, LUCA
11 - Dipartimento di Informatica Sistemistica Telematica (DIST) (attivo dal 01/01/1984 al 18/07/2012)
A Structural Approach to Reasoning with Quantified Boolean Formulas
2009-01-01 Pulina, Luca; Tacchella, Armando
Collaborative Expert Portfolio Management
2010-01-01 Stern, D. H.; Samulowitz, H.; Herbrich, R.; Graepel, T.; Pulina, Luca; Tacchella, Armando
Engineering approaches and methods to verify software in autonomous systems
2014-01-01 Cicala, Giuseppe; Khalili, Ali; Metta, Giorgio; Natale, L.; Pathak, Shashank; Pulina, Luca; Tacchella, Armando
Hard QBF Encodings made easy: Dream or Reality?
2009-01-01 Pulina, Luca; Tacchella, Armando
Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
2009-01-01 Pulina, Luca; Tacchella, Armando
pyNeVer: A Framework for Learning and Verification of Neural Networks
2021-01-01 Guidotti, D; Pulina, L; Tacchella, A
QuBIS: An (In)complete Solver for Quantified Boolean Formulas
2008-01-01 Pulina, Luca; Tacchella, Armando
Ranking and Reputation Systems in the QBF Competition
2007-01-01 Narizzano, Massimo; Pulina, Luca; Tacchella, Armando
Safe Learning with Real-Time Constraints: A Case Study
2010-01-01 Metta, Giorgio; Natale, Lorenzo; Pathak, Shashank; Pulina, Luca; Tacchella, Armando
The QBFEVAL Web Portal
2006-01-01 Narizzano, Massimo; Pulina, Luca; Tacchella, Armando
The Seventh QBF Solvers Evaluation (QBFEVAL'10)
2010-01-01 Peschiera, C; Pulina, Luca; Tacchella, Armando; Bubeck, U; Kullmann, O; Lynce, I.
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
2008-01-01 Pulina, Luca; Tacchella, Armando
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A Structural Approach to Reasoning with Quantified Boolean Formulas | 1-gen-2009 | Pulina, Luca; Tacchella, Armando | |
| Collaborative Expert Portfolio Management | 1-gen-2010 | Stern, D. H.; Samulowitz, H.; Herbrich, R.; Graepel, T.; Pulina, Luca; Tacchella, Armando | |
| Engineering approaches and methods to verify software in autonomous systems | 1-gen-2014 | Cicala, Giuseppe; Khalili, Ali; Metta, Giorgio; Natale, L.; Pathak, Shashank; Pulina, Luca; Tacchella, Armando | |
| Hard QBF Encodings made easy: Dream or Reality? | 1-gen-2009 | Pulina, Luca; Tacchella, Armando | |
| Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas | 1-gen-2009 | Pulina, Luca; Tacchella, Armando | |
| pyNeVer: A Framework for Learning and Verification of Neural Networks | 1-gen-2021 | Guidotti, D; Pulina, L; Tacchella, A | |
| QuBIS: An (In)complete Solver for Quantified Boolean Formulas | 1-gen-2008 | Pulina, Luca; Tacchella, Armando | |
| Ranking and Reputation Systems in the QBF Competition | 1-gen-2007 | Narizzano, Massimo; Pulina, Luca; Tacchella, Armando | |
| Safe Learning with Real-Time Constraints: A Case Study | 1-gen-2010 | Metta, Giorgio; Natale, Lorenzo; Pathak, Shashank; Pulina, Luca; Tacchella, Armando | |
| The QBFEVAL Web Portal | 1-gen-2006 | Narizzano, Massimo; Pulina, Luca; Tacchella, Armando | |
| The Seventh QBF Solvers Evaluation (QBFEVAL'10) | 1-gen-2010 | Peschiera, C; Pulina, Luca; Tacchella, Armando; Bubeck, U; Kullmann, O; Lynce, I. | |
| Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings | 1-gen-2008 | Pulina, Luca; Tacchella, Armando |