Sciweavers

58 search results - page 2 / 12
» Correctness of Multiplicative Additive Proof Structures is N...
Sort
View
WINE
2010
Springer
148views Economy» more  WINE 2010»
13 years 2 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...
LPAR
2007
Springer
13 years 11 months ago
Permutative Additives and Exponentials
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
Gabriele Pulcini
ENTCS
2007
107views more  ENTCS 2007»
13 years 4 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
ARITH
2003
IEEE
13 years 8 months ago
Representable Correcting Terms for Possibly Underflowing Floating Point Operations
Studying floating point arithmetic, authors have shown that the implemented operations (addition, subtraction, multiplication, division and square root) can compute a result and a...
Sylvie Boldo, Marc Daumas
ECBS
2000
IEEE
97views Hardware» more  ECBS 2000»
13 years 9 months ago
Ensuring Structure and Behavior Correctness in Design Composition
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan