Sciweavers

295 search results - page 2 / 59
» Games and Definability for System F
Sort
View
107
Voted
AAAI
2010
14 years 11 months ago
A Temporal Proof System for General Game Playing
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Michael Thielscher, Sebastian Voigt
ICFP
2007
ACM
15 years 10 months ago
A type directed translation of MLF to system F
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
Daan Leijen
92
Voted
ICFP
2005
ACM
15 years 10 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
70
Voted
AAAI
2000
14 years 11 months ago
Defining and Using Ideal Teammate and Opponent Agent Models
A common challenge for agents in multiagent systems is trying to predict what other agents are going to do in the future. Such knowledge can help an agent determine which of its c...
Peter Stone, Patrick Riley, Manuela M. Veloso
DAM
2008
111views more  DAM 2008»
14 years 10 months ago
Games played by Boole and Galois
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Aviezri S. Fraenkel