Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Localizing temporal constraint propagation: defaults and exceptions
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Maintaining knowledge about temporal intervals
Communications of the ACM
An Efficient Algorithm for Reasoning about Time Intervals
Expertensysteme '87: Konzepte und Werkzeuge, Tagung I/1987 des German Chapter of the ACM
Qualitative Modeling of Time in Technical Applications
Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 4. Internationaler GI-Kongress Wissensbasierte Systeme
Temporal matching: recognizing dynamic situations from discrete measurements
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Managing efficiently temporal relations through indexed spanning trees
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Temporal representation and reasoning in artificial intelligence: A review
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Temporal reasoning is widely used in AI. especially for natural language processing. Existing methods for temporal reasoning are extremely expensive in time and space. because complete graphs are used. We present an approach of temporal reasoning for expert systems in technical applications that reduces the amount of time and space by using sequence graphs. A sequence graph consists of one or more sequence chains and other intervals that are connected only loosely with these chains. Sequence chains are based on the observation that in technical applications many events occur sequentially. The uninterrupted execution of technical processes for a long time is characteristic for technical applications. To relate the first intervals in the application with the last ones makes no sense. In sequence graphs only these relations are stored that are needed for further propagation. In contrast to other algorithms which use incomplete graphs. no information is lost and the reduction of complexity is significant. Additionally. the representation is more transparent. because the "flow" of time is modelled.