Using Decomposition-Parameters for QBF: Mind the Prefix!
Authors: Eduart Eiben, Robert Ganian, Sebastian Ordyniak
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | 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. |
| Researcher Affiliation | Academia | Eduard Eiben, Robert Ganian, Sebastian Ordyniak TU Wien, Vienna, Austria |
| Pseudocode | No | The paper describes algorithmic procedures (Initialization, Introduce, Forget, Termination) and provides theoretical complexity analysis for them, but it does not present them in a structured pseudocode block or a clearly labeled algorithm section. |
| Open Source Code | No | The paper does not provide any statements about releasing open-source code for the described methodology, nor does it provide any links to a code repository. |
| Open Datasets | No | The paper is theoretical and does not involve experiments with datasets. Therefore, no information about publicly available datasets is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve experiments with datasets, so it does not provide information on training/validation/test splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any specific hardware used for running experiments. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not include details on experimental setup, hyperparameters, or training configurations. |