The following pages link to Luca Pulina (Q421444):
Displayed 20 items.
- \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Constrained image generation using binarized neural networks with decision procedures (Q1656604) (← links)
- QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
- Algorithm selection for paracoherent answer set computation (Q2296732) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Translation-based approaches for solving disjunctive temporal problems with preferences (Q2331097) (← links)
- (Q3005896) (← links)
- Challenging SMT solvers to verify neural networks (Q3164970) (← links)
- Solving disjunctive temporal problems with preferences using maximum satisfiability (Q3164971) (← links)
- Evaluating and certifying QBFs: A comparison of state-of-the-art tools (Q3400890) (← links)
- (Q3429159) (← links)
- Multi-level Algorithm Selection for ASP (Q3449227) (← links)
- Multi-engine ASP solving with policy adaptation (Q3458886) (← links)
- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
- Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows (Q4589245) (← links)
- Evaluating probabilistic model checking tools for verification of robot control policies (Q4592700) (← links)
- The Seventh QBF Solvers Evaluation (QBFEVAL’10) (Q4930592) (← links)
- Applying Machine Learning Techniques to ASP Solving (Q5398041) (← links)
- Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings (Q5505579) (← links)