Luca Pulina

From MaRDI portal
Person:421444

Available identifiers

zbMath Open pulina.lucaDBLP35/6729WikidataQ58179229 ScholiaQ58179229MaRDI QIDQ421444

List of research outcomes





PublicationDate of PublicationType
QBFFam: a tool for generating QBF families from proof complexity2022-03-22Paper
Algorithm selection for paracoherent answer set computation2020-02-18Paper
Translation-based approaches for solving disjunctive temporal problems with preferences2019-10-25Paper
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)2019-08-28Paper
Constrained image generation using binarized neural networks with decision procedures2018-08-10Paper
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows2017-11-09Paper
Evaluating probabilistic model checking tools for verification of robot control policies2017-11-08Paper
Multi-engine ASP solving with policy adaptation2015-12-28Paper
Multi-level Algorithm Selection for ASP2015-11-04Paper
Applying machine learning techniques to ASP solving2014-02-25Paper
Solving disjunctive temporal problems with preferences using maximum satisfiability2012-10-25Paper
Challenging SMT solvers to verify neural networks2012-10-25Paper
\textsc{NeVer}: a tool for artificial neural networks verification2012-05-23Paper
An empirical study of QBF encodings: from treewidth estimation to useful preprocessing2011-06-10Paper
The seventh QBF solvers evaluation (QBFEVAL'10)2010-09-29Paper
Evaluating and certifying QBFs: a comparison of state-of-the-art tools2010-01-27Paper
Learning to integrate deduction and search in reasoning about quantified Boolean formulas2010-01-07Paper
A self-adaptive multi-engine solver for quantified Boolean formulas2009-05-29Paper
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings2009-01-27Paper
Report of the third QBF solvers evaluation2007-03-30Paper

Research outcomes over time

This page was built for person: Luca Pulina