Sciweavers

6 search results - page 1 / 2
» A Solver for QBFs in Nonprenex Form
Sort
View
ECAI
2006
Springer
13 years 7 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
JSAT
2010
130views more  JSAT 2010»
12 years 10 months ago
DepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
Florian Lonsing, Armin Biere
SAT
2010
Springer
136views Hardware» more  SAT 2010»
13 years 7 months ago
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
William Klieber, Samir Sapra, Sicun Gao, Edmund M....
AUSAI
2004
Springer
13 years 9 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
SAT
2010
Springer
132views Hardware» more  SAT 2010»
13 years 2 months ago
Exploiting Circuit Representations in QBF Solving
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...
Alexandra Goultiaeva, Fahiem Bacchus