2062 search results - page 46 / 413 » Derivatives of Logical Formulas |
FUZZIEEE
2007
IEEE
15 years 5 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
88
Voted
JELIA
2010
Springer
14 years 9 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
86
Voted
ISQED
2002
IEEE
15 years 3 months ago
2002
IEEE
As the process technology advances into the deep submicron era, interconnect plays a dominant role in determining circuit performance. Buffer insertion/sizing and wire sizing are ...
81
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
96
Voted
C3S2E
2010
ACM
15 years 17 hour ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...