scientific article; zbMATH DE number 5719280
From MaRDI portal
Publication:3566747
Recommendations
- Logic versus Approximation
- Theory and Applications of Satisfiability Testing
- Boolean functions as models for quantified Boolean formulas
- Theory and Applications of Satisfiability Testing
- Nested Boolean functions as models for quantified Boolean formulas
- On the Specification and Verification of Model Transformations
- Rewriting Models of Boolean Programs
Cited in
(23)- A satisfiability procedure for quantified Boolean formulae
- Expansion-based QBF solving versus Q-resolution
- Long-distance Q-resolution with dependency schemes
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- A mechanism of uncovering of quantifiers in Boolean variables
- Solving QBF with counterexample guided refinement
- Dependency schemes for DQBF
- Long distance Q-resolution with dependency schemes
- An empirical study of QBF encodings: from treewidth estimation to useful preprocessing
- Transformations into normal forms for quantified circuits
- Exploiting structure in quantified formulas
- Preprocessing for DQBF
- Planning as quantified Boolean formula
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- scientific article; zbMATH DE number 1979551 (Why is no real title available?)
- Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- New approaches to Boolean quantifier elimination
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Moving definition variables in quantified Boolean formulas
- Transforming quantified Boolean formulas using biclique covers
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566747)
