111 search results - page 12 / 23 » A Proof of Strong Normalisation using Domain Theory |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
LICS
1990
IEEE
14 years 17 days ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
CSFW
2010
IEEE
14 years 13 days ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
FCT
2007
Springer
14 years 12 days ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
AAAI
1996
13 years 9 months ago
1996
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...