327 search results - page 59 / 66 » Semantics for Evidence-Based Argumentation |
TAMC
2010
Springer
14 years 25 days ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
ICFP
1999
ACM
14 years 2 days ago
1999
ACM
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
POPL
1998
ACM
14 years 3 hour 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...
PKC
1998
Springer
13 years 12 months ago
1998
Springer
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
ICLP
1990
Springer
13 years 11 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...