Models and counter-models of quantified Boolean formulas (invited talk)

DOI10.4230/LIPICS.SAT.2024.1MaRDI QIDQ6864445zbMATH OpenFDO

Authors Martina Seidl

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.1

zbMATH Keywords

quantified Boolean formulasolution countingsolution extraction

Mathematics Subject Classification ID

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

Cites work

• A First Step Towards a Unified Proof Checker for QBF
• ALLQBF solving by computational learning
• Automated Deduction – CADE-20
• CAQE and QuAbS: Abstraction Based QBF Solvers
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Enhancing search-based QBF solving by dynamic blocked clause elimination
• Incremental determinization
• On Unification of QBF Resolution-Based Calculi
• OuterCount: a first-level solution-counter for quantified Boolean formulas
• Proof Complexity of Quantified Boolean Logic — A Survey
• Q-resolution with generalized axioms
• QBF Resolution Systems and Their Proof Complexities
• Resolution for quantified Boolean formulas
• SAT-Based Synthesis Methods for Safety Specs
• Skolem function continuation for quantified Boolean formulas
• Solution validation and extraction for QBF preprocessing
• Symmetries of quantified Boolean formulas
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• The QBF Gallery: behind the scenes
• Unified QBF certification and its applications
• Validation of QBF encodings with winning strategies

This page was built for publication: Models and counter-models of quantified Boolean formulas (invited talk)

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