2062 search results - page 46 / 413 » Derivatives of Logical Formulas |
132
click to vote
FUZZIEEE
2007
IEEE
15 years 9 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 ...
134
Voted
JELIA
2010
Springer
15 years 1 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...
133
click to vote
ISQED
2002
IEEE
15 years 8 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 ...
118
Voted
CORR
2006
Springer
15 years 3 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 ...
148
Voted
C3S2E
2010
ACM
15 years 4 months 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...