In this paper we extend the logic of violation proposed by [14] with time, more precisely, we temporalise that logic. The resulting system allows us to capture many subtleties of t...
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...