David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 5 (2):157-175 (1996)
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Andrew Soltau, Times Two: The Tenses of Linear and Collapse Dynamics in Relational Quantum Mechanics.
Misao Nagayama & Mitsuhiro Okada (2001). A New Correctness Criterion for the Proof Nets of Non-Commutative Multiplicative Linear Logics. Journal of Symbolic Logic 66 (4):1524-1542.
Márta Somogyvári (2009). Time and Responsibility. World Futures 65 (5):342-355.
ElŻbieta Hajnicz (1999). Some Considerations on Branching Areas of Time. Journal of Logic, Language and Information 8 (1):17-43.
Sylvain Degeilh & Anne Preller (2005). Efficiency of Pregroups and the French Noun Phrase. Journal of Logic, Language and Information 14 (4):423-444.
Anne Preller (2007). Linear Processing with Pregroups. Studia Logica 87 (2-3):171 - 197.
Elżbieta Hajnicz (1995). Some Considerations on Non-Linear Time Intervals. Journal of Logic, Language and Information 4 (4):335-357.
Added to index2009-01-28
Total downloads2 ( #398,800 of 1,410,432 )
Recent downloads (6 months)1 ( #177,872 of 1,410,432 )
How can I increase my downloads?