|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Use dmy dates|date=June 2013}}
| | Hi there, I am Andrew Berryhill. To climb is some thing I truly enjoy performing. Some time in the past she selected to reside in Alaska and her mothers and fathers live close by. Since he was 18 he's been working as an information officer but he ideas on changing it.<br><br>Here is my blog post: online psychic chat, [http://1.234.36.240/fxac/m001_2/7330 1.234.36.240], |
| ''For the type of boolean algebra called interval algebra, see [[Boolean_algebra_(structure)#Examples|Boolean algebra (structure)]]''
| |
| | |
| '''Allen's interval algebra''' is a calculus for [[spatial-temporal reasoning|temporal reasoning]] that was introduced by [[James F. Allen]] in 1983.
| |
| | |
| The calculus defines possible relations between time intervals and provides a composition table that can be used as a basis
| |
| for reasoning about temporal descriptions of events.
| |
| | |
| ==Formal description==
| |
| | |
| === Relations ===
| |
| | |
| The following 13 base relations capture the possible relations between two intervals.
| |
| | |
| {| class="wikitable"
| |
| !Relation
| |
| !Illustration
| |
| !Interpretation
| |
| |-
| |
| |<math>X \mathbf{\operatorname{<}} Y</math>
| |
| <math>Y \mathbf{\operatorname{>}} X</math>
| |
| |[[Image:Allen calculus before.png|X takes place before Y]]
| |
| |X takes place before Y
| |
| |-
| |
| |<math>X \mathbf{\operatorname{m}} Y</math>
| |
| <math>Y \mathbf{\operatorname{mi}} X</math>
| |
| |[[Image:Allen calculus meet.png|X meets Y]]
| |
| |X meets Y (''i'' stands for '''''i'''nverse'')
| |
| |-
| |
| |<math>X \mathbf{\operatorname{o}} Y</math>
| |
| <math>Y \mathbf{\operatorname{oi}} X</math>
| |
| |[[Image:Allen calculus overlap.png|X overlaps with Y]]
| |
| |X overlaps with Y
| |
| |-
| |
| |<math>X \mathbf{\operatorname{s}} Y</math>
| |
| <math>Y \mathbf{\operatorname{si}} X</math>
| |
| |[[Image:Allen calculus start.png|X starts with Y]]
| |
| |X starts Y
| |
| |-
| |
| |<math>X \mathbf{\operatorname{d}} Y</math>
| |
| <math>Y \mathbf{\operatorname{di}} X</math>
| |
| |[[Image:Allen calculus during.png|X during Y]]
| |
| |X during Y
| |
| |-
| |
| |<math>X \mathbf{\operatorname{f}} Y</math>
| |
| <math>Y \mathbf{\operatorname{fi}} X</math>
| |
| |[[Image:Allen calculus finish.png|X finishes with Y]]
| |
| |X finishes Y
| |
| |-
| |
| |<math>X \mathbf{\operatorname{=}} Y</math>
| |
| |[[Image:Allen calculus equal.png|X is equal to Y]]
| |
| |X is equal to Y
| |
| |}
| |
| | |
| Using this calculus, given facts can be formalized and then used for automatic reasoning. Relations between intervals are formalized as sets of base relations.
| |
| | |
| The sentence
| |
| : ''During dinner, Peter reads newspaper. Afterwards, he goes to bed.''
| |
| is formalized in Allen's Interval Algebra as follows:
| |
| | |
| <math>\mbox{newspaper } \mathbf{\{ \operatorname{d}, \operatorname{s}, \operatorname{f} \}} \mbox{ dinner}</math>
| |
| | |
| <math>\mbox{dinner } \mathbf{\{ \operatorname{<}, \operatorname{m} \}} \mbox{ bed}</math> | |
| | |
| In general, the number of different relations between n intervals is 1, 1, 13, 409, 23917, 2244361... [http://oeis.org/A055203 OEIS A055203]. The special case shown above is for n=2.
| |
| | |
| ===Composition of relations between intervals===
| |
| For reasoning about the relations between temporal intervals, Allen's Interval Algebra provides a [[Relation composition|composition]] table. Given the relation between <math>X</math> and <math>Y</math> and the relation between <math>Y</math> and <math>Z</math>, the composition table allows for concluding about the relation between <math>X</math> and <math>Z</math>. Together with a [[Inverse relation|converse]] operation, this turns Allen's Interval Algebra into a [[relation algebra]].
| |
| | |
| For the example, one can infer <math>\mbox{newspaper } \mathbf{\{ \operatorname{<}, \operatorname{m} \}} \mbox{ bed}</math>.
| |
| | |
| ==Extensions==
| |
| Allen's Interval Algebra can be used for the description of both temporal intervals and spatial configurations. For the latter use, the relations are interpreted as describing the relative position of spatial objects. This also works for three-dimensional objects by listing the relation for each coordinate separately.
| |
| | |
| ==Implementation==
| |
| * [http://code.google.com/p/allenintervalrelationships/ A simple java library implementing the concept of Allen's temporal relations and the path consistency algorithm]
| |
| | |
| ==See also==
| |
| * [[Temporal logic]]
| |
| * [[Logic]]
| |
| * [[Region Connection Calculus]].
| |
| | |
| ==References==
| |
| * James F. Allen: ''Maintaining knowledge about temporal intervals''. In: ''Communications of the ACM''. 26 November 1983. ACM Press. pp. 832–843, ISSN 0001-0782
| |
| * Bernhard Nebel, Hans-Jürgen Bürckert: ''Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra.'' In: ''Journal of the ACM'' 42, pp. 43–66. 1995.
| |
| * Peter van Beek, Dennis W. Manchak: ''The design and experimental analysis of algorithms for temporal reasoning.'' In: ''Journal of Artificial Intelligence Research'' 4, pp. 1–18, 1996.
| |
| | |
| [[Category:Knowledge representation]]
| |
| [[Category:Constraint programming]]
| |
Hi there, I am Andrew Berryhill. To climb is some thing I truly enjoy performing. Some time in the past she selected to reside in Alaska and her mothers and fathers live close by. Since he was 18 he's been working as an information officer but he ideas on changing it.
Here is my blog post: online psychic chat, 1.234.36.240,