Extended Failed-Literal Preprocessing for Quantified Boolean Formulas

DOI10.1007/978-3-642-31612-8_8zbMath1273.68189OpenAlexW2130935769MaRDI QIDQ2843325

Florian Lonsing, Samuel B. Wood, Allen van Gelder

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_8

zbMATH Keywords

QBFquantified Boolean formulaspreprocessinglook-ahead1-saturationextended failed literalsfailed literals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

The QBF Gallery: behind the scenes ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Subsumption-linear Q-resolution for QBF theorem proving

Uses Software

• Bloqqer

This page was built for publication: Extended Failed-Literal Preprocessing for Quantified Boolean Formulas