351 search results - page 30 / 71 » On the Learnability of Boolean Formulae |
SAT
2004
Springer
14 years 1 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
WPES
2003
ACM
14 years 29 days ago
2003
ACM
Hidden Credentials are useful in situations where requests for service, credentials, access policies and resources are extremely sensitive. We show how transactions which depend o...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
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...
AAAI
2007
13 years 10 months ago
2007
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...