Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: Sets as Memory traces.
Posted:
Feb 10, 2013 5:28 PM


On Feb 10, 11:13 pm, Graham Cooper <grahamcoop...@gmail.com> wrote: > > "temporal reasoning in artificial intelligence" > > About 1,950,000 results (0.40 seconds) > > http://www.cs.brandeis.edu/~cs112/cs1122004/newReadings/allentimea... > > Time and Time Again: The Many Ways to Represent Time > James F Allen > The University of Rochester > > I. Representations Based on Dating Schemes > > A good representation of time for instantaneous events, if it is > possible, is using an absolute dating system. This involves time > stamping each event with an absolute realtime, say taken off the > system clock on the machine, or some other coarsergrained system such > as we use for dating in everyday life. For instance, a convenient > dating scheme could be a tuple consisting of the year > > II. Constraint Propagation Approaches > > There has been a considerable amount of work in Artificial > Intelligence in defining temporal reasoning systems that used the > technique of constraint propagation. These systems use a graphbased > representation where each time is linked to each other time with an > arc labeled with the possible temporal relationships between the times > > III. DurationBased Representations > > With the exception of the first technique using absolute dates, we > have been ignoring the problem of representing temporal durations. In > this section we will examine some representations that operate > primarily using duration information. The basic technique for dealing > with duration information is seen in PERT networks. This > representation maintains a partial ordering of events in an acyclic > directed graph that > has both a distinguished beginning and ending event. Each node in the > graph represents an event and has an associated duration. > > IV. Temporal Logics > > So far we have only discussed the representation of ... > > read more »
Thanks



