1912 search results - page 139 / 383 » On the evaluation of argumentation formalisms |
162
click to vote
CONCUR
2004
Springer
15 years 12 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
177
click to vote
SEMWEB
2004
Springer
15 years 11 months ago
2004
Springer
In 1984, Peter Patel-Schneider published a paper [1] entitled Small can be Beautiful in Knowledge Representation in which he advocated for limiting the expressive power of knowledg...
169
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
175
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
144
click to vote
LREC
2010
15 years 8 months ago
2010
We describe a process for converting the Penn Arabic Treebank into the CCG formalism. Previous efforts have yielded CCGbanks in English, German, and Turkish, thus opening these la...