Eiben, E., Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2020) Using decomposition-parameters for QBF: Mind the prefix! Journal of Computer and System Sciences, 110. pp. 1-21. ISSN 0022-0000
Abstract
Similar to the satisfiability (SAT) problem, which can be seen to be the archetypical problem for NP, the quantified Boolean formula problem (QBF) is the archetypical problem for PSPACE. Recently, Atserias and Oliva (2014) showed that, unlike for SAT, many of the well-known decompositional parameters (such as treewidth and pathwidth) do not allow efficient algorithms for QBF. The main reason for this seems to be the lack of awareness of these parameters towards the dependencies between variables of a QBF formula. In this paper we extend the ordinary pathwidth to the QBF-setting by introducing prefix pathwidth, which takes into account the dependencies between variables in a QBF, and show that it leads to an efficient algorithm for QBF. We hope that our approach will help to initiate the study of novel tailor-made decompositional parameters for QBF and thereby help to lift the success of these decompositional parameters from SAT to QBF.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2020 Published by Elsevier Inc. This is an author produced version of a paper subsequently published in Journal of Computer and System Sciences. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). |
Keywords: | Quantified Boolean formulas; Dependency schemes; Treewidth; Pathwidth; Parameterized complexity |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 28 Apr 2020 14:23 |
Last Modified: | 08 Jan 2021 01:39 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.jcss.2019.12.005 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:160011 |