Sciweavers

884 search results - page 126 / 177
» A Proof Theory for DL-Lite
Sort
View
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 12 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
15 years 6 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
CSL
2009
Springer
15 years 6 months ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
CSL
2009
Springer
15 years 6 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
15 years 6 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...