Luca Pulina

Available identifiers

zbMath Open pulina.lucaDBLP35/6729WikidataQ58179229 ScholiaQ58179229MaRDI QIDQ421444

List of research outcomes

Publication	Date of Publication	Type
QBFFam: a tool for generating QBF families from proof complexity	2022-03-22	Paper
Algorithm selection for paracoherent answer set computation	2020-02-18	Paper
Translation-based approaches for solving disjunctive temporal problems with preferences	2019-10-25	Paper
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)	2019-08-28	Paper
Constrained image generation using binarized neural networks with decision procedures	2018-08-10	Paper
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows	2017-11-09	Paper
Evaluating probabilistic model checking tools for verification of robot control policies	2017-11-08	Paper
Multi-engine ASP solving with policy adaptation	2015-12-28	Paper
Multi-level Algorithm Selection for ASP	2015-11-04	Paper
Applying machine learning techniques to ASP solving	2014-02-25	Paper
Solving disjunctive temporal problems with preferences using maximum satisfiability	2012-10-25	Paper
Challenging SMT solvers to verify neural networks	2012-10-25	Paper
\textsc{NeVer}: a tool for artificial neural networks verification	2012-05-23	Paper
An empirical study of QBF encodings: from treewidth estimation to useful preprocessing	2011-06-10	Paper
The seventh QBF solvers evaluation (QBFEVAL'10)	2010-09-29	Paper
Evaluating and certifying QBFs: a comparison of state-of-the-art tools	2010-01-27	Paper
Learning to integrate deduction and search in reasoning about quantified Boolean formulas	2010-01-07	Paper
A self-adaptive multi-engine solver for quantified Boolean formulas	2009-05-29	Paper
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings	2009-01-27	Paper
Report of the third QBF solvers evaluation	2007-03-30	Paper

Research outcomes over time

This page was built for person: Luca Pulina