Sciweavers

922 search results - page 109 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
FOSSACS
2010
Springer
14 years 3 months ago
A Hierarchy for Delimited Continuations in Call-by-Name
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
Alexis Saurin
WWW
2009
ACM
14 years 3 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes
STACS
2009
Springer
14 years 3 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
LICS
2008
IEEE
14 years 3 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
FSEN
2007
Springer
14 years 3 months ago
Hoare Logic for ARM Machine Code
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...
Magnus O. Myreen, Anthony C. J. Fox, Michael J. C....