This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a framework for processing temporal constraints that permits the processing of metric information, namely, assessments of time differences between events.Expand

This paper presents a general, network-based computational model for temporal reasoning, capable of handling both qualitative and quantitative information.Expand

This thesis introduces a new approach to temporal reasoning which increases both the expressive power and the flexibility of handling temporal information. It also offers a unifying conceptualization… Expand

We develop a polynomial time algorithm that, given an arbitrary constraint network, generates a precise tree representation whenever such a tree can be extracted from the input network; otherwise, the fact that no tree representation exists is acknowledged and the tree generated may serve as a good approximation to the original network.Expand

relating those decisional variables, thus making it possible to apply classical constraints propagation used in planning. Those meta-structures exist together with the classical time-points graph… Expand

We develop a polynomial-time algorithm that, given an arbitrary binary constraint network, either extracts (by edge removal) a precise tree representation from the path-consistent version of the network or acknowledges that no such tree can be extracted.Expand

This paper presents a general model for temporal reasoning, capable of handling both qualita tive and quantitative information. This model allows the representation and processing of all types of… Expand