In this paper, we describe the n-dimensional projective approach as a hierarchical and modular architecture with a processing mechanism that underlies both spatial backtracking an...
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
Reasoning about others, as performed by agents in order to coordinate their behaviours with those of others, commonly involves forming and updating beliefs about hidden system pro...
Ontologies are expected to play an important role in many application domains, as well as in software engineering in general. One problem with using ontologies within software engi...