Applying Allen's constraint propagation algorithm for non-linear time

The famous Allen's interval relations constraint propagation algorithm was intended for linear time. Its 13 primitive relations define all the possible mutual locations of two intervals on the time-axis. In this paper an application of the algorithm for non-linear time is suggested. First, a new primitive relation is added. It is called excludes since an occurrence of one event in a certain course of events excludes an occurrence of the other event in this course. Next, new composition rules for relations between intervals are presented: some of the old rules are extended by the relation excludes, and entirely new ones are formulated for composing the relation excludes with the other relations. Four different composition tables are considered. The choice of a composition table depends on whether time is branching or not, and whether intervals can contain non-collinear subintervals or not.
Keywords constraint propagation  non-linear time  time representation algorithms
Categories (categorize this paper)
DOI 10.1007/BF00173698
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,349
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Some Considerations on Non-Linear Time Intervals.Elżbieta Hajnicz - 1995 - Journal of Logic, Language and Information 4 (4):335-357.

Add more citations

Similar books and articles
Added to PP index

Total downloads
7 ( #535,084 of 2,193,590 )

Recent downloads (6 months)
1 ( #290,647 of 2,193,590 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature