144 search results - page 18 / 29 » The complexity of Boolean formula minimization |
ENTCS
2006
15 years 1 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
104
click to vote
CPC
2004
15 years 1 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
120
click to vote
ICCAD
1994
IEEE
15 years 5 months ago
1994
IEEE
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
151
click to vote
DLT
2009
14 years 11 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
120
click to vote
PLDI
2009
ACM
15 years 8 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...