Sciweavers

1078 search results - page 110 / 216
» The Modal Logic of Probability
Sort
View
149
Voted
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 3 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
LOGCOM
2002
105views more  LOGCOM 2002»
15 years 3 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
TCS
2011
14 years 11 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
VLSID
2009
IEEE
87views VLSI» more  VLSID 2009»
16 years 4 months ago
Soft Error Rates with Inertial and Logical Masking
We analyze the neutron induced soft error rate (SER). An induced error pulse is modeled by two parameters, probability of occurrence and probability density function of the pulse ...
Fan Wang, Vishwani D. Agrawal
MICCAI
2009
Springer
16 years 5 months ago
Automatic Correction of Intensity Nonuniformity from Sparseness of Gradient Distribution in Medical Images
We propose to use the sparseness property of the gradient probability distribution to estimate the intensity nonuniformity in medical images, resulting in two novel automatic metho...
Yuanjie Zheng, Murray Grossman, Suyash P. Awate,...