Luca Pulina

MaRDI QIDQ421444zbMATH OpenDBLPORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Constraints	2019-10-25	Paper
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) Artificial Intelligence	2019-08-28	Paper
Constrained image generation using binarized neural networks with decision procedures (available as arXiv preprint)	2018-08-10	Paper
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows Fundamenta Informaticae	2017-11-09	Paper
Evaluating probabilistic model checking tools for verification of robot control policies AI Communications	2017-11-08	Paper
Multi-engine ASP solving with policy adaptation Journal Of Logic And Computation	2015-12-28	Paper
Multi-level Algorithm Selection for ASP Logic Programming and Nonmonotonic Reasoning	2015-11-04	Paper
Applying machine learning techniques to ASP solving	2014-02-25	Paper
Solving disjunctive temporal problems with preferences using maximum satisfiability AI Communications	2012-10-25	Paper
Challenging SMT solvers to verify neural networks AI Communications	2012-10-25	Paper
\textsc{NeVer}: a tool for artificial neural networks verification Annals of Mathematics and Artificial Intelligence	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) Theory and Applications of Satisfiability Testing – SAT 2010	2010-09-29	Paper
Evaluating and certifying QBFs: a comparison of state-of-the-art tools AI Communications	2010-01-27	Paper
Learning to integrate deduction and search in reasoning about quantified Boolean formulas Frontiers of Combining Systems	2010-01-07	Paper
A self-adaptive multi-engine solver for quantified Boolean formulas Constraints	2009-05-29	Paper
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings Logic for Programming, Artificial Intelligence, and Reasoning	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