92 search results - page 3 / 19 » Exploiting structure in quantified formulas |
ICMI
2004
Springer
14 years 21 days ago
2004
Springer
Although gesture recognition has been studied extensively, communicative, affective, and biometrical “utility” of natural gesticulation remains relatively unexplored. One of t...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
JAIR
2011
13 years 2 months ago
2011
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
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 ...
AAAI
2008
13 years 9 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...