Luca Pulina
Associate Professor
lpulina@uniss.it
About Me

He is Associate Professor of Computer Science. He received a Ph.D. in Computer Engineering and Robotics from the University of Genoa, Italy, in 2009. His research activities focus on Automated Reasoning, Formal Verification and Knowledge Representation. He served in the organizing and technical program committee of several international conferences. He has (co-)authored more than fifty publications in peer-reviewed journals, international conferences, and workshops. He was involved as principal investigator of a regional project, while he participated in European and national projects.

Research Interests

Formal Methods, Knoweldge Representation, Artificial Intelligence

Publications
79 entries « 2 of 2 »

2012

Maratea, M; Pulina, L; Ricca, F

The multi-engine ASP solver me-asp Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7519 LNAI , pp. 484-487, 2012.

Links | BibTeX

Grosso, E; Pulina, L; Tistarelli, M

Modeling biometric template update with Ant Colony Optimization Conference

2012.

Links | BibTeX

Pulina, L; Tacchella, A

Challenging SMT solvers to verify neural networks Journal Article

AI Communications, 25 (2), pp. 117-135, 2012.

Links | BibTeX

Maratea, M; Pulina, L

Solving disjunctive temporal problems with preferences using maximum satisfiability Journal Article

AI Communications, 25 (2), pp. 137-156, 2012.

Links | BibTeX

Grosso, E; Lagorio, A; Pulina, L; Tistarelli, M

Understanding critical factors in appearance-based gender categorization Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7584 LNCS (PART 2), pp. 280-289, 2012.

Links | BibTeX

2011

Pulina, L; Tacchella, A

Checking safety of neural networks with SMT solvers: A comparative evaluation Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6934 LNAI , pp. 127-138, 2011.

Links | BibTeX

Maratea, M; Pulina, L

Over-subscription planning with Boolean optimization: An assessment of state-of-the-art solutions Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6934 LNAI , pp. 420-425, 2011.

Links | BibTeX

Pulina, L; Tacchella, A

NEVER: A tool for artificial neural networks verification Journal Article

Annals of Mathematics and Artificial Intelligence, 62 (3-4), pp. 403-425, 2011.

Links | BibTeX

2010

Pulina, L; Tacchella, A

An empirical study of QBF encodings: From treewidth estimation to useful preprocessing Journal Article

Fundamenta Informaticae, 102 (3-4), pp. 391-427, 2010.

Links | BibTeX

Pulina, L; Tacchella, A

An abstraction-refinement approach to verification of artificial neural networks Conference

616 , 2010.

Links | BibTeX

Metta, G; Natale, L; Pathak, S; Pulina, L; Tacchella, A

Safe learning with real-time constraints: A case study Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6096 LNAI (PART 1), pp. 133-142, 2010.

Links | BibTeX

Metta, G; Natale, L; Pathak, S; Pulina, L; Tacchella, A

Safe and effective learning: A case study Conference

2010.

Links | BibTeX

Pulina, L; Tacchella, A

An abstraction-refinement approach to verification of artificial neural networks Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6174 LNCS , pp. 243-257, 2010.

Links | BibTeX

Peschiera, C; Pulina, L; Tacchella, A; Bubeck, U; Kullmann, O; Lynce, I

The seventh QBF solvers evaluation (QBFEVAL'10) Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6175 LNCS , pp. 237-250, 2010.

Links | BibTeX

Pulina, L

Engineering portfolios of Machine Learning algorithms to solve complex tasks in Robotics and Automated Reasoning Journal Article

AI Communications, 23 (1), pp. 61-63, 2010.

Links | BibTeX

Stern, D; Herbrich, R; Graepel, T; Samulowitz, H; Pulina, L; Tacchella, A

Collaborative expert portfolio management Conference

1 , AI Access Foundation, 2010.

Links | BibTeX

2009

Pulina, L; Tacchella, A

Hard QBF encodings made easy: Dream or reality? Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5883 LNAI , pp. 31-41, 2009.

Links | BibTeX

Pulina, L; Tacchella, A

Learning to integrate deduction and search in reasoning about quantified boolean formulas Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5749 LNAI , pp. 350-365, 2009.

Links | BibTeX

Narizzano, M; Peschiera, C; Pulina, L; Tacchella, A

Evaluating and certifying QBFs: A comparison of state-of-the-art tools Journal Article

AI Communications, 22 (4), pp. 191-210, 2009.

Links | BibTeX

Pulina, L; Tacchella, A

A self-adaptive multi-engine solver for quantified Boolean formulas Journal Article

Constraints, 14 (1), pp. 80-116, 2009.

Links | BibTeX

Pulina, L; Tacchella, A

A structural approach to reasoning with quantified Boolean formulas Conference

589 , CEUR-WS, 2009.

Links | BibTeX

Pulina, L; Tacchella, A

Treewidth: A useful marker of empirical hardness in quantified boolean logic encodings Conference

451 , CEUR-WS, 2009.

Links | BibTeX

Pulina, L; Tacchella, A

A structural approach to reasoning with quantified Boolean formulas Conference

International Joint Conferences on Artificial Intelligence, 2009.

Links | BibTeX

Kontchakov, R; Pulina, L; Sattler, U; Schneider, T; Selmer, P; Wolter, F; Zakharyaschev, M

Minimal module extraction from DL-lite ontologies using QBF solvers Conference

International Joint Conferences on Artificial Intelligence, 2009.

Links | BibTeX

2008

Pulina, L; Tacchella, A

QuBIS: An (in)complete solver for quantified boolean formulas Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5317 LNAI , pp. 34-43, 2008.

Links | BibTeX

Pulina, L; Tacchella, A

Treewidth: A useful marker of empirical hardness in quantified boolean logic encodings Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5330 LNAI , pp. 528-542, 2008.

Links | BibTeX

2007

Pulina, L; Tacchella, A

A multi-engine solver for quantified boolean formulas Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4741 LNCS , pp. 574-589, 2007.

Links | BibTeX

Narizzano, M; Pulina, L; Tacchella, A

Ranking and reputation systems in the QBF competition Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4733 LNAI , pp. 97-108, 2007.

Links | BibTeX

2006

Narizzano, M; Pulina, L; Tacchella, A

The QBFEVAL web portal Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4160 LNAI , pp. 494-497, 2006.

Links | BibTeX

79 entries « 2 of 2 »