4217 search results - page 99 / 844 » Computational indistinguishability logic |
146
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
162
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and sing...
151
click to vote
ICCS
2007
Springer
16 years 16 days ago
2007
Springer
The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precisely: As Peirce wanted to develop a logic of relatives (i.e., relations...
169
click to vote
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
149
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Hybrid Hall effect (HHE) devices are a new class of reconfigurable logic devices that incorporate ferromagnetic elements to deliver nonvolatile operation. A single HHE de...