Small Resolution Proofs for QBF using Dependency Treewidth

D 2018

Small Resolution Proofs for QBF using Dependency Treewidth

EIBEN, Eduard; Robert GANIAN a Sebastian ORDYNIAK

Základní údaje

Originální název

Small Resolution Proofs for QBF using Dependency Treewidth

Autoři

EIBEN, Eduard; Robert GANIAN a Sebastian ORDYNIAK

Vydání

Nemecko, STACS 2018, od s. 1-15, 15 s. 2018

Nakladatel

Dagstuhl

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/18:00106813

Organizační jednotka

Fakulta informatiky

ISBN

978-3-95977-062-0

ISSN

Klíčová slova anglicky

QBF; treewidth; fixed parameter tractability; dependency schemes

Štítky

core_A, firank_A

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 27. 4. 2020 23:07, Mgr. Michal Petr

Anotace

V originále

In spite of the close connection between the evaluation of quantified Boolean formulas (QBF) and propositional satisfiability (SAT), tools and techniques which exploit structural properties of SAT instances are known to fail for QBF. This is especially true for the structural parameter treewidth, which has allowed the design of successful algorithms for SAT but cannot be straightforwardly applied to QBF since it does not take into account the interdependencies between quantified variables. In this work we introduce and develop dependency treewidth, a new structural parameter based on treewidth which allows the efficient solution of QBF instances. Dependency treewidth pushes the frontiers of tractability for QBF by overcoming the limitations of previously introduced variants of treewidth for QBF. We augment our results by developing algorithms for computing the decompositions that are required to use the parameter.

Návaznosti

MSM0021622419, záměr

Název: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Vysoce paralelní a distribuované výpočetní systémy

Citovat

EIBEN, Eduard; Robert GANIAN a Sebastian ORDYNIAK. Small Resolution Proofs for QBF using Dependency Treewidth. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-15. ISBN 978-3-95977-062-0. Dostupné z: https://doi.org/10.4230/LIPIcs.STACS.2018.28.

@inproceedings{1523756,
   author = {Eiben, Eduard and Ganian, Robert and Ordyniak, Sebastian},
   address = {Nemecko},
   booktitle = {STACS 2018},
   doi = {https://doi.org/10.4230/LIPIcs.STACS.2018.28},
   editor = {Rolf Niedermeier, Brigitte Vallee},
   keywords = {QBF; treewidth; fixed parameter tractability; dependency schemes},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {Nemecko},
   isbn = {978-3-95977-062-0},
   pages = {1-15},
   publisher = {Dagstuhl},
   title = {Small Resolution Proofs for QBF using Dependency Treewidth},
   year = {2018}
}

TY  - CONF
ID  - 1523756
AU  - Eiben, Eduard - Ganian, Robert - Ordyniak, Sebastian
PY  - 2018
TI  - Small Resolution Proofs for QBF using Dependency Treewidth
PB  - Dagstuhl
CY  - Nemecko
SN  - 9783959770620
KW  - QBF
KW  - treewidth
KW  - fixed parameter tractability
KW  - dependency schemes
N2  - In spite of the close connection between the evaluation of quantified Boolean formulas (QBF) and propositional satisfiability (SAT), tools and techniques which exploit structural properties of SAT instances are known to fail for QBF. This is especially true for the structural parameter treewidth, which has allowed the design of successful algorithms for SAT but cannot be straightforwardly applied to QBF since it does not take into account the interdependencies between quantified variables. In this work we introduce and develop dependency treewidth, a new structural parameter based on treewidth which allows the efficient solution of QBF instances. Dependency treewidth pushes the frontiers of tractability for QBF by overcoming the limitations of previously introduced variants of treewidth for QBF. We augment our results by developing algorithms for computing the decompositions that are required to use the parameter.
ER  -

EIBEN, Eduard; Robert GANIAN a Sebastian ORDYNIAK. Small Resolution Proofs for QBF using Dependency Treewidth. Online. In Rolf Niedermeier, Brigitte Vallee. \textit{STACS 2018}. Nemecko: Dagstuhl, 2018, s.~1-15. ISBN~978-3-95977-062-0. Dostupné z: https://doi.org/10.4230/LIPIcs.STACS.2018.28.

Přehled o publikaci