Frege systems for quantified Boolean logic
From MaRDI portal
Recommendations
Cited in
(23)- Lower bounds for QCDCL via formula gauge
- Hardness and optimality in QBF proof systems modulo NP
- Proof complexity of symbolic QBF reasoning
- Characterising tree-like Frege proofs for QBF
- A simple proof of QBF hardness
- Quasi-truth-functional systems of propositional logic
- Understanding Gentzen and Frege Systems for QBF
- scientific article; zbMATH DE number 4116498 (Why is no real title available?)
- scientific article; zbMATH DE number 806744 (Why is no real title available?)
- Lower bounds for QCDCL via formula gauge
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
- Towards Uniform Certification in QBF
- Proof Complexity of Quantified Boolean Logic — A Survey
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- QBF merge resolution is powerful but unnatural
- From proof complexity to circuit complexity via interactive protocols
- Hard QBFs for merge resolution
- Understanding the relative strength of QBF CDCL solvers and QBF resolution
- Polynomial calculus for quantified Boolean logic: lower bounds through circuits and degree
- Circuits, proofs and propositional model counting
- Extending merge resolution to a family of QBF-proof systems
- Systems of combinatory logic related to Quine's `New Foundations'
- Proof complexity of modal resolution
This page was built for publication: Frege systems for quantified Boolean logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133965)
