Declarative Rule

• Name: Time Point for Temporal Reasoning
• Description in English: This temporal reasoning step represents a combination of one or more of the following facts about time points. We use the a shorthand notation where < means "before", <= means "before-or-equal-point", and = means "equal-point": If a < b, and b < c, then a < c. [Transitivity of "before"] If a <= b, and b <= c, then a <= c. [Transitivity of "before-or-equal-point"] If a < b, and b <= c, then a < c. [Composition of "before" and "before-or-equal-point"] If a < b, and b = c, then a < c. [Composition of "before" and "equal-point"] If a = b, and b <= c, then a <= c. [Composition of "equal-point" and "before-or-equal-point".]
• Source(s):
  • Name: KSL JTP Inference engine development team
  • Member(s):
    • Name: Gleb Frank
    • URL: http://xenon.stanford.edu/~gkfrank/
    • Name: Jessica Jenkins
    • URL: http://www-ksl.stanford.edu/people/jessicaj/
    • Name: Richard Fikes
    • URL: http://www.ksl.stanford.edu/people/bio/fikes.html
    • Affiliation(s):
      • Name: Knowledge Systems Laboratory, Stanford University
      • URL: http://www.KSL.Stanford.EDU

(Registration details...)

Copyright 2009 Inference Web group.
All Rights Reserved.