Sciweavers

4217 search results - page 99 / 844
» Computational indistinguishability logic
Sort
View
CORR
1998
Springer
107views Education» more  CORR 1998»
14 years 9 months ago
Computing Declarative Prosodic Morphology
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...
Markus Walther
ICCAD
2000
IEEE
113views Hardware» more  ICCAD 2000»
15 years 2 months ago
Don't Cares and Multi-Valued Logic Network Minimization
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...
Yunjian Jiang, Robert K. Brayton
ICCS
2007
Springer
15 years 4 months ago
Constants and Functions in Peirce's Existential Graphs
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...
Frithjof Dau
CONCUR
2003
Springer
15 years 3 months ago
Model Checking a Path
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” ...
Nicolas Markey, Ph. Schnoebelen
FPL
2003
Springer
74views Hardware» more  FPL 2003»
15 years 3 months ago
Reconfigurable Circuits Using Hybrid Hall Effect Devices
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...
Steve Ferrera, Nicholas P. Carter