TIME AND TIME AGAIN - THE MANY WAYS TO REPRESENT TIME

被引:119
作者
ALLEN, JF
机构
[1] Department of Computer Science, University of Rochester, Rochester, New York
关键词
D O I
10.1002/int.4550060403
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the most crucial problems in any computer system that involves representing the world is the representation of time. This includes applications such as databases, simulation, expert systems, and applications of Artificial Intelligence in general. In this brief article, I will give a survey of the basic techniques available for representing time, and then talk about temporal reasoning in a general setting as needed in AI applications. Quite different representations of time are usable depending on the assumptions that can be made about the temporal information to be represented. The most crucial issue is the degree of certainty one can assume. Can one assume that a timestamp can be assigned to each event, or barring that, that the events are fully ordered? Or can we only assume that a partial ordering of events is known? Can events be simultaneous? Can they overlap in time and yet not be simultaneous? If they are not instaneous, do we know the durations of events? Different answers to each of these questions allow very different representations of time.
引用
收藏
页码:341 / 355
页数:15
相关论文
共 22 条
[1]  
ALLEN J, 1989, TR325 U ROCHESTER
[2]  
ALLEN J, 1990, REASONING ABOUT PLAN
[3]  
ALLEN J, 1990, IN PRESS COMPUTATION
[4]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[5]  
DEAN T, 1988, AAAI88 P LOS ALT
[6]   TEMPORAL DATABASE-MANAGEMENT [J].
DEAN, TL ;
MCDERMOTT, DV .
ARTIFICIAL INTELLIGENCE, 1987, 32 (01) :1-55
[7]  
DOWTY D, 1920, LINGUIST PHILOS, V9, P37
[8]  
HAREL D, 1979, 1ST ORDER DYNAMIC LO
[9]  
KOOMEN H, 1989, P PRINCIPLES KNOWLED
[10]  
LADKIN P, 1988, REPRESENTATIN REASON