Extended Failed-Literal Preprocessing for Quantified Boolean Formulas

DOI10.1007/978-3-642-31612-8_8MaRDI QIDQ2843325zbMATH OpenOpenAlexFDO

Authors Samuel B. Wood, Florian Lonsing, 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

1-saturationextended failed literalsfailed literalslook-aheadpreprocessingQBFquantified Boolean formulas

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• Encoding deductive argumentation in quantified Boolean formulae
• Solving dependency quantified Boolean formulas using quantifier localization
• Contributions to the theory of practical quantified Boolean formula solving
• Failed literal detection for QBF
• On models for quantified Boolean formulas
• A satisfiability procedure for quantified Boolean formulae
• A symbolic search based approach for quantified Boolean formulas
• Preprocessing Boolean formulae for BDDs in a probabilistic context

Cited in

(5)

• Conformant planning as a case study of incremental QBF solving
• The QBF Gallery: behind the scenes
• Failed literal detection for QBF
• Theory and Applications of Satisfiability Testing
• Subsumption-linear Q-resolution for QBF theorem proving

Describes a project that uses

Uses Software

• Bloqqer

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

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