Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 16 / Issue 11

available in:   PDF (76 kB) PS (63 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-016-11-1425


Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals

André Trudel (Acadia University, Canada)

Abstract: 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.

Keywords: Allen's Interval Algebra, infinite temporal intervals, temporal knowledge representation and reasoning

Categories: I.2.4