Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q113902759, #quickstatements; #temporary_batch_1711574657256 |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: semprop / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: DepQBF / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10703-021-00371-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3195087575 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q113902759 / rank | |||
Normal rank |
Revision as of 00:36, 28 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations |
scientific article |
Statements
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (English)
0 references
8 December 2021
0 references
quantified Boolean formulas
0 references
decision procedures
0 references
CEGAR
0 references