Sciweavers

9 search results - page 2 / 2
» Solving Advanced Reasoning Tasks Using Quantified Boolean Fo...
Sort
View
AUSAI
2004
Springer
14 years 1 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...
JSAT
2006
83views more  JSAT 2006»
13 years 7 months ago
Report of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
Massimo Narizzano, Luca Pulina, Armando Tacchella
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 4 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
AAAI
2010
13 years 5 months ago
Exploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
Alexandra Goultiaeva, Fahiem Bacchus