Luca Pulina
Luca Pulina
Verified email at uniss.it - Homepage
Title
Cited by
Cited by
Year
An abstraction-refinement approach to verification of artificial neural networks
L Pulina, A Tacchella
International Conference on Computer Aided Verification, 243-257, 2010
1662010
A self-adaptive multi-engine solver for quantified Boolean formulas
L Pulina, A Tacchella
Constraints 14 (1), 80-116, 2009
1152009
Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers.
R Kontchakov, L Pulina, U Sattler, T Schneider, P Selmer, F Wolter, ...
IJCAI 9, 836-841, 2009
932009
Challenging SMT solvers to verify neural networks
L Pulina, A Tacchella
Ai Communications 25 (2), 117-135, 2012
752012
A multi-engine solver for quantified boolean formulas
L Pulina, A Tacchella
International Conference on Principles and Practice of Constraint …, 2007
742007
A multi-engine approach to answer-set programming
M Maratea, L Pulina, F Ricca
Theory and Practice of Logic Programming 14 (6), 841-868, 2014
562014
A multi-engine approach to answer-set programming
M Maratea, L Pulina, F Ricca
Theory and Practice of Logic Programming 14 (6), 841-868, 2014
562014
Collaborative Expert Portfolio Management.
DH Stern, H Samulowitz, R Herbrich, T Graepel, L Pulina, A Tacchella
AAAI, 179-184, 2010
512010
Report of the third QBF solvers evaluation
M Narizzano, L Pulina, A Tacchella
Journal on Satisfiability, Boolean Modeling and Computation 2, 145-164, 2006
472006
The seventh QBF solvers evaluation (QBFEVAL’10)
C Peschiera, L Pulina, A Tacchella, U Bubeck, O Kullmann, I Lynce
International Conference on Theory and Applications of Satisfiability …, 2010
442010
Automated verification of neural networks: Advances, challenges and perspectives
F Leofante, N Narodytska, L Pulina, A Tacchella
arXiv preprint arXiv:1805.09938, 2018
402018
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
M Narizzano, C Peschiera, L Pulina, A Tacchella
AI communications 22 (4), 191-210, 2009
352009
Temporal and Spatial OBDA with Many-Dimensional Halpern-Shoham Logic
R Kontchakov, L Pandolfo, L Pulina, V Ryzhikov, M Zakharyaschev
IJCAI, 2016
282016
The Ninth QBF Solvers Evaluation–Preliminary Report
L Pulina
Proceedings of the 4th International Workshop on Quantified Boolean Formulas …, 2016
222016
A structural approach to reasoning with quantified Boolean formulas.
L Pulina, A Tacchella
IJCAI, 596-602, 2009
222009
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
P Marin, M Narizzano, L Pulina, A Tacchella, E Giunchiglia
Fundamenta Informaticae 149 (1-2), 133-158, 2016
182016
Ensuring safety of policies learned by reinforcement: Reaching objects in the presence of obstacles with the iCub
S Pathak, L Pulina, G Metta, A Tacchella
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2013
182013
An ontology for historical research documents
G Adorni, M Maratea, L Pandolfo, L Pulina
International Conference on Web Reasoning and Rule Systems, 11-18, 2015
162015
Treewidth: A useful marker of empirical hardness in quantified boolean logic encodings
L Pulina, A Tacchella
International Conference on Logic for Programming Artificial Intelligence …, 2008
162008
NeVer: a tool for artificial neural networks verification
L Pulina, A Tacchella
Annals of Mathematics and Artificial Intelligence 62 (3-4), 403-425, 2011
152011
The system can't perform the operation now. Try again later.
Articles 1–20