IRIS

PULINA, LUCA

PULINA, LUCA  

11 - Dipartimento di Informatica Sistemistica Telematica (DIST) (attivo dal 01/01/1984 al 18/07/2012)  

Mostra records
Risultati 1 - 16 di 16 (tempo di esecuzione: 0.028 secondi).
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
Evaluating probabilistic model checking tools for verification of robot control policies 1-gen-2016 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
NeVer2: learning and verification of neural networks 1-gen-2024 Demarchi, S.; Guidotti, D.; Pulina, L.; Tacchella, A.
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.
Translation-based approaches for solving disjunctive temporal problems with preferences 1-gen-2018 Giunchiglia, E.; Maratea, M.; Pulina, L.
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings 1-gen-2008 Pulina, Luca; Tacchella, Armando
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows 1-gen-2016 Marin, Paolo; Narizzano, Massimo; Pulina, Luca; Tacchella, Armando; Giunchiglia, Enrico