A representation for efficient temporal reasoning
Conference
·
OSTI ID:430684
- Simon Fraser Univ., Burnaby, British Columbia (Canada)
It has been observed that the temporal reasoning component in a knowledge-based system is frequently a bottleneck. We investigate here a class of graphs appropriate for an interesting class of temporal domains and for which very efficient algorithms for reasoning are obtained, that of series-parallel graphs. These graphs can be used for example to model process execution, as well as various planning or scheduling activities. Events are represented by nodes of a graph and relationships are represented by edges labeled by {le} or <. Graphs are composed using a sequence of series and parallel steps (recursively) on series-parallel graphs. We show that there is an O(n) time preprocessing algorithm that allows us to answer queries about the events in O(l) time. Our results make use of a novel embedding of the graphs on the plane that is of independent interest. Finally we argue that these results may be incorporated in general graphs representing temporal events by extending the approach of Gerevini and Schubert.
- OSTI ID:
- 430684
- Report Number(s):
- CONF-960876--
- Country of Publication:
- United States
- Language:
- English
Similar Records
On finding lowest common ancestors
Geospatial-temporal semantic graph representations of trajectories from remote sensing and geolocation data
Adverse Event Prediction Using Graph-Augmented Temporal Analysis (Final Report)
Journal Article
·
Wed Nov 30 23:00:00 EST 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6450109
Geospatial-temporal semantic graph representations of trajectories from remote sensing and geolocation data
Patent
·
Tue Aug 08 00:00:00 EDT 2017
·
OSTI ID:1374438
Adverse Event Prediction Using Graph-Augmented Temporal Analysis (Final Report)
Technical Report
·
Mon Oct 01 00:00:00 EDT 2018
·
OSTI ID:1481631