Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-8102
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ; day:23 ; month:8 ; year:2021 ; pages:1-21
Formal methods in system design ; (23.8.2021), 1-21
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10703-021-00371-7
- URN
-
urn:nbn:de:101:1-2021110820100859825806
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bloem, Roderick
- Braud-Santoni, Nicolas
- Hadzic, Vedad
- Egly, Uwe
- Lonsing, Florian
- Seidl, Martina
- SpringerLink (Online service)
Other Objects (12)
Proof Complexity of Quantified Boolean Formulas
Model-based transformations for quantified boolean formulas
The Symmetry Rule for Quantified Boolean Formulas
Combinations of Boolean Gröbner Bases and SAT Solvers
Embedding Arbitrary Boolean Circuits into Fungal Automata
Algorithm selection, scheduling and configuration of Boolean constraint solvers
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Boolean masking for arithmetic additions at arbitrary order in hardware
Exact formulas for a thin-lens system with an arbitrary number of lenses
On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems
Boolean algebras
Proof Complexity of Quantified Boolean Formulas
Model-based transformations for quantified boolean formulas
The Symmetry Rule for Quantified Boolean Formulas
Combinations of Boolean Gröbner Bases and SAT Solvers
Embedding Arbitrary Boolean Circuits into Fungal Automata
Algorithm selection, scheduling and configuration of Boolean constraint solvers
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Boolean masking for arithmetic additions at arbitrary order in hardware
Exact formulas for a thin-lens system with an arbitrary number of lenses
On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems
Boolean algebras
Proof Complexity of Quantified Boolean Formulas
Model-based transformations for quantified boolean formulas
The Symmetry Rule for Quantified Boolean Formulas
Combinations of Boolean Gröbner Bases and SAT Solvers
Embedding Arbitrary Boolean Circuits into Fungal Automata
Algorithm selection, scheduling and configuration of Boolean constraint solvers
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Boolean masking for arithmetic additions at arbitrary order in hardware
Exact formulas for a thin-lens system with an arbitrary number of lenses
On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers
A concept of controlling Grover diffusion operator: a new approach to solve arbitrary Boolean-based problems