A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class
2005
Artificial Intelligence
In many applications of temporal reasoning we are interested in processing temporal information incrementally. In particular, given a set of temporal constraints (a temporal CSP) and a new constraint, we want to maintain certain properties of the extended temporal CSP (e.g., a solution), rather than recomputing them from scratch. The Point Algebra (PA) and the Interval Algebra (IA) are two well-known frameworks for qualitative temporal reasoning. The reasoning algorithms for PA and the
doi:10.1016/j.artint.2005.04.005
fatcat:52sydbdppre7tgqccawxo4emdi