Pages that link to "Item:Q2435315"
From MaRDI portal
The following pages link to Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315):
Displaying 15 items.
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- (Q5090460) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- A resolution proof system for dependency stochastic Boolean satisfiability (Q6050766) (← links)
