8094 search results - page 97 / 1619 » Improvements in Formula Generalization |
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
SAT
2009
Springer
14 years 3 months ago
2009
Springer
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
SAT
2009
Springer
14 years 3 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
SIGSOFT
2003
ACM
14 years 2 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
ICLP
1990
Springer
14 years 1 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...