Sciweavers

8 search results - page 1 / 2
» Solving QBF by Combining Conjunctive and Disjunctive Normal ...
Sort
View
SAT
2004
Springer
109views Hardware» more  SAT 2004»
13 years 10 months ago
Resolve and Expand
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
Armin Biere
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
13 years 9 months ago
Leveraging dominators for preprocessing QBF
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
ECAI
2006
Springer
13 years 8 months ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 8 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller