We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
In this paper, we introduce a new, formal model of learning object metadata. The model enables more formal, rigorous reasoning over metadata. An important feature of the model is t...
Abstract. We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other informat...
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...