62 search results - page 3 / 13 » Applying Logic Synthesis for Speeding Up SAT |
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including...
SAT
2004
Springer
14 years 12 days ago
2004
Springer
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
ARITH
2009
IEEE
14 years 1 months ago
2009
IEEE
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, espec...