Abstract. This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather informatio...
Ian Toyn, Samuel H. Valentine, Susan Stepney, Stev...
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
We propose an opponent modeling approach for no-limit Texas hold-em poker that starts from a (learned) prior, i.e., general expectations about opponent behavior and learns a relat...
Marc J. V. Ponsen, Jan Ramon, Tom Croonenborghs, K...
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...