351 search results - page 56 / 71 » On the Learnability of Boolean Formulae |
AAAI
2010
13 years 5 months ago
2010
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...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
CEEMAS
2001
Springer
14 years 5 days ago
2001
Springer
Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be...