We introduce a new subclass of Allen's interval algebra we call “ORD-Horn subclass,” which
is a strict superset of the “pointisable subclass.” We prove that reasoning in the ORD-Horn …

At present, Internet-based information processing systems are challenged by different kinds
of threats, which lead to various types of damages that in turn result in significant loss of …

Temporal events are regarded here as intervals on a time line, This paper deals with
problems m reasoning about such intervals when the prccisc topological relationship …

The concepts of binary constraint satisfaction problems can be naturally generalized to the
relation algebras of Tarski. The concept of path-consistency plays a central role. Algorithms …

Allen's interval algebra is one of the best established formalisms for temporal reasoning.
This article provides the final step in the classification of complexity for satisfiability problems …

This collection represents the primary reference work for researchers and students in the
area of Temporal Reasoning in Artificial Intelligence. Temporal reasoning has a vital role to …

Qualitative reasoning about space and time-a reasoning at the human level-promises to
become a fundamental aspect of future systems that will accompany us in daily activity. The …

While the worst-case computational properties of Allen's calculus for qualitative temporal
reasoning have been analyzed quite extensively, the determination of the empirical …

We present a fast algorithm for solving qualitative interval constraint problems, which returns
solutions of random problems in less than half a second on average, with the hardest …

Time is one of the most relevant topics in AI. It plays a major role in several areas, ranging
from logical foundations to applications of knowledge‐based systems. In this paper, we …