4401 search results - page 546 / 881 » Computing with Default Logic |
202
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
196
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
159
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
148
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, ...
150
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. This paper proposes a method of characterizing correlation of signal tra...