Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
In real-life multi-agent planning problems, long-term plans will often be invalidated by changes in the environment during or after the planning process. When this happens, short-t...
Xiaoyu Mao, Adriaan ter Mors, Nico Roos, Cees Witt...
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
When a plan involves hundreds or thousands of events over time it can be di cult or impossible to tell whether those events are unfolding \according to plan" and to assess th...