264 search results - page 22 / 53 » Making Argumentation More Believable |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We construct a formal framework for investigating epistemic and temporal notions in the context of distributed quantum systems. While we rely on structures developed in [DDKP05], w...
ENTCS
2006
13 years 7 months ago
2006
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
JASIS
2008
13 years 7 months ago
2008
This article focuses on why academic writers in computer science and sociology sometimes supply the reader with more details of citees' names than they need to: why citers na...
JANCL
2007
13 years 7 months ago
2007
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
ISDA
2010
IEEE
13 years 5 months ago
2010
IEEE
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...