Solving temporal constraint networks with qualitative reasoning and fuzzy rules

Constraint satisfaction techniques play an important role in current computer science. Many difficult problems involving search from areas such as machine vision, scheduling, graph algorithms, machine design, and manufacturing can be considered to be the cases of the constraint satisfaction problem. In this paper, we construct an Infinite Temporal Interval Group for temporal constraint propagation. This interval algebra is also extended for spatial constraint reasoning. We develop an O(n)-time algorithm for propagation temporal constraint between two time events. For solving point/interval algebra networks, we develop an O(n²)-time algorithm for finding all pairs of feasible relations, where n is the number of points or intervals. A set of algorithms is proposed to manage spatio-temporal knowledge