Using decomposition-parameters for QBF: mind the prefix!
From MaRDI portal
Publication:2304627
DOI10.1016/j.jcss.2019.12.005zbMath1435.68123OpenAlexW2998965526MaRDI QIDQ2304627
Robert Ganian, Eduard Eiben, Sebastian Ordyniak
Publication date: 13 March 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://eprints.whiterose.ac.uk/160011/1/main.pdf
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier reordering for QBF
- Fundamentals of parameterized complexity
- The disjoint paths problem in quadratic time
- Backdoor sets of quantified Boolean formulas
- Graph minors. I. Excluding a forest
- Treewidth. Computations and approximations
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- Resolution for quantified Boolean formulas
- An infinite antichain of permutations
- Upper bounds to the clique width of graphs
- Bounded-width QBF is PSPACE-complete
- Approximating clique-width and branch-width
- Directed path-width and monotonicity in digraph searching
- Tree-width for first order formulae
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Variable Dependencies and Q-Resolution
- Small Resolution Proofs for QBF using Dependency Treewidth
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. II. Algorithmic aspects of tree-width
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Integrating Dependency Schemes in Search-Based QBF Solvers
- Theory and Applications of Satisfiability Testing
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
This page was built for publication: Using decomposition-parameters for QBF: mind the prefix!
