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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of automated reasoning Jg. 63; H. 3; S. 597 - 623
Hauptverfasser:	Beyersdorff, Olaf, Blinkhorn, Joshua, Chew, Leroy, Schmidt, Renate, Suda, Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.10.2019 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!