In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
This paper presents a logical framework for negotiation based on belief revision theory. We consider that a negotiation process is a course or multiple courses of mutual belief re...
Dongmo Zhang, Norman Y. Foo, Thomas Andreas Meyer,...
Sketch recognition systems are currently being developed for many domains, but can be time consuming to build if they are to handle the intricacies of each domain. This paper pres...
We describe the application of plan recognition techniques to support human intelligence analysts in processing national security alert sets by automatically identifying the hosti...