4217 search results - page 72 / 844 » Computational indistinguishability logic |
BIRTHDAY
2008
Springer
14 years 12 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
MTDT
1999
IEEE
15 years 2 months ago
1999
IEEE
Continuing improvements in semiconductor fabrication density are enabling new classes of System-on-aChip architectures that combine extensive processing logic and high-density mem...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
EATCS
2000
14 years 9 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
ISMVL
1994
IEEE
15 years 2 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...