On models for quantified Boolean formulas
From MaRDI portal
Recommendations
Cited in
(17)- Boolean functions as models for quantified Boolean formulas
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
- Transformations into normal forms for quantified circuits
- Validating QBF Validity in HOL4
- Proving Valid Quantified Boolean Formulas in HOL Light
- scientific article; zbMATH DE number 5719280 (Why is no real title available?)
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- Boolean valued models and incomplete specifications
- Boolean Models and Simultaneous Inequalities
- A PROCEDURE OF IMPLICATION USING QUANTIFIABLE BINARY RELATION ON THE STRUCTURAL MODELING
- Theory and Applications of Satisfiability Testing
- Nested Boolean functions as models for quantified Boolean formulas
- Equivalence models for quantified Boolean formulas
- Looking algebraically at tractable quantified Boolean formulas
- Model-independent bounding of the supports of Boolean formulae in binary data
- Minimal False Quantified Boolean Formulas
- Models and quantifier elimination for quantified Horn formulas
This page was built for publication: On models for quantified Boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712370)