Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows

DOI10.3233/FI-2016-1445MaRDI QIDQ4589245zbMATH OpenOpenAlexWikidataFDO

Authors Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1445

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Theory and Applications of Satisfiability Testing
• The seventh QBF solvers evaluation (QBFEVAL'10)
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Report of the third QBF solvers evaluation
• Theory and Applications of Satisfiability Testing

Cited in

(4)

• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• The seventh QBF solvers evaluation (QBFEVAL'10)
• Quantifier shifting for quantified Boolean formulas revisited

This page was built for publication: Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589245)