5378 search results - page 81 / 1076 » Base Logics in Argumentation |
114
click to vote
LREC
2010
15 years 7 months ago
2010
We present an approach to automatically identifying the arguments of discourse connectives based on data from the Penn Discourse Treebank. Of the two arguments of connectives, cal...
142
click to vote
AIL
2000
15 years 5 months ago
2000
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
162
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
126
click to vote
JOC
2010
15 years 21 days ago
2010
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
150
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...