From DQBF to QBF by Dependency Elimination
- 9 August 2017
- book chapter
- Published by Springer Nature
- p. 326-343
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- SAT-Based Synthesis Methods for Safety Specs2014
- Computing Resolution-Path Dependencies in Linear Time ,2012
- Solving QBF with Counterexample Guided Refinement2012
- Variable Independence and Resolution Paths for Quantified Boolean FormulasLecture Notes in Computer Science, 2011
- Backdoor Sets of Quantified Boolean FormulasJournal of Automated Reasoning, 2008
- Erratum: Variable Dependencies of Quantified CSPs2008
- Dependency Quantified Horn Formulas: Models and Complexity2006
- Lower bounds for multiplayer noncooperative games of incomplete informationComputers & Mathematics with Applications, 2001
- Cycles in bipartite tournamentsJournal of Combinatorial Theory, Series B, 1982
- Reducibility among Combinatorial Problems1972