Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infinite. Intervals in the network can be finite, left-infinite, right-infinite, or infinite in both directions. The network's intervals can all be of the same type, or different. We present algorithms for finding a consistent scenario.
allen's interval algebra infinite temporal intervals temporal knowledge representation and reasoning