1818 search results - page 168 / 364 » Granularity-Adaptive Proof Presentation |
123
click to vote
DCG
1999
15 years 3 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
123
Voted
LISP
2002
15 years 3 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
142
Voted
LOGCOM
2002
15 years 3 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
144
Voted
LOGCOM
1998
15 years 3 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
139
Voted
NJC
2002
15 years 3 months ago
2002
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...