Minimal False Quantified Boolean Formulas

DOI10.1007/11814948_32MaRDI QIDQ5756555zbMATH OpenOpenAlexFDO

Authors Hans Kleine Büning, Xishun Zhao

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814948_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The Minimization Problem for Boolean Formulas
• Minimally generated Boolean algebras
• Boolean minors
• An extension of deficiency and minimal unsatisfiability of quantified Boolean formulas
• Boolean functions as models for quantified Boolean formulas
• Minimally unsatisfiable Boolean circuits
• The complexity of Boolean formula minimization
• The Complexity of Boolean Formula Minimization
• Logic versus Approximation

Cited in

(5)

• Boolean minors
• An extension of deficiency and minimal unsatisfiability of quantified Boolean formulas
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency
• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
• Strong inconsistency

This page was built for publication: Minimal False Quantified Boolean Formulas

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