Dependency Quantified Horn Formulas: Models and Complexity
From MaRDI portal
Recommendations
- Models and quantifier elimination for quantified Horn formulas
- Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
- Henkin quantifiers and Boolean formulae
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
Cited in
(17)- Sensitivity analysis for Horn formulae
- Building strategies into QBF proofs
- Davis and Putnam meet Henkin: solving DQBF with resolution
- Certified DQBF solving by definition extraction
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- Characterization results for d-Horn formulas, or on formulas that are true on dual reduced products
- Dependency schemes for DQBF
- Henkin quantifiers and Boolean formulae
- Preprocessing for DQBF
- Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
- On quantified propositional logics and the exponential time hierarchy
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- Complexity of validity for propositional dependence logics
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Models and quantifier elimination for quantified Horn formulas
This page was built for publication: Dependency Quantified Horn Formulas: Models and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756561)