Massimo Narizzano

MaRDI QIDQ814444zbMATH OpenORCIDWikidataFDO

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
Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows Fundamenta Informaticae	2017-11-09	Paper
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning 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
Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science	2009-07-24	Paper
Clause/Term resolution and learning in the evaluation of quantified Boolean formulas (available as arXiv preprint)	2009-04-28	Paper
Principles and Practice of Constraint Programming – CP 2004 Lecture Notes in Computer Science	2008-09-09	Paper
Report of the third QBF solvers evaluation	2007-03-30	Paper
Formal Methods in Computer-Aided Design Lecture Notes in Computer Science	2006-10-20	Paper
Backjumping for quantified Boolean logic satisfiability Artificial Intelligence	2006-02-07	Paper
Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science	2005-12-16	Paper
Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science	2005-12-16	Paper
scientific article; zbMATH DE number 1884351 (Why is no real title available?)	2003-03-18	Paper
scientific article; zbMATH DE number 1765680 (Why is no real title available?)	2002-07-10	Paper
Towards an efficient library for SAT: A manifesto	2001-09-24	Paper

Research outcomes over time

This page was built for person: Massimo Narizzano