Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF

Dependency quantified Boolean formulas (DQBF) and QBF dependency schemes have been treated separately in the literature, even though both treatments extend QBF by replacing the linear order of the quantifier prefix with a partial order. We propose to merge the two, by reinterpreting a dependency sch...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of automated reasoning Ročník 63; číslo 3; s. 597 - 623
Hlavní autoři:	Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Dordrecht Springer Netherlands 01.10.2019 Springer Nature B.V
Témata:	Artificial Intelligence Boolean algebra Computer Science Dependence Mapping Mathematical Logic and Formal Languages Mathematical Logic and Foundations Reduction Symbolic and Algebraic Manipulation Quantified Boolean formulas DQBF F.2.2 Nonnumerical algorithms and problems Dependency schemes
ISSN:	0168-7433, 1573-0670, 1573-0670
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!