168 search results - page 22 / 34 » On Models for Quantified Boolean Formulas |
148
Voted
FM
2009
Springer
16 years 28 days ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
192
Voted
SAT
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
187
Voted
RTSS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
164
Voted
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
173
Voted
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...