Maintaining knowledge about temporal intervals

TL;DR: An interval logic for reasoning about space is described, which supports a simpler ontology, has fewer functions and relations, yet does not su er in terms of its useful expressiveness.

TL;DR: This article provides a detailed overview of various state-of-the-art research papers on human activity recognition, discussing both the methodologies developed for simple human actions and those for high-level activities.

TL;DR: It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.

TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

TL;DR: In this paper, the authors consider the problem of reasoning about whether a strategy will achieve a goal in a deterministic world and present a method to construct a sentence of first-order logic which will be true in all models of certain axioms if and only if a certain strategy can achieve a certain goal.

TL;DR: In this paper, a first-order temporal logic is proposed, in which it is possible to name and prove things about facts, events, plans, and world histories, as well as the persistence of facts and the relationship between tasks and actions.

TL;DR: A common disclaimer by an AI author is that he has neglected temporal considerations to avoid complication; the implication is nearly made that adding a temporal dimension to the research would be a familiar but tedious exercise that would obscure the new material presented by the author.