The following pages link to On QBF Proofs and Preprocessing (Q2870148):
Displaying 16 items.
- Quantified maximum satisfiability (Q272016) (← links)
- QBF as an alternative to Courcelle's theorem (Q1656581) (← links)
- Shortening QBF proofs with dependency schemes (Q1680258) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Short proofs in QBF expansion (Q2181919) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Incremental Determinization (Q2818028) (← links)
- On Stronger Calculi for QBFs (Q2818031) (← links)
- Fast DQBF Refutation (Q3192073) (← links)
- Understanding Gentzen and Frege Systems for QBF (Q4635870) (← links)
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (Q4930581) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- (Q5136303) (← links)
- Theory and Applications of Satisfiability Testing (Q5714777) (← links)