Time and time again: The many ways to represent time

计算机科学 运筹学 数据科学 人工智能 数学
作者
James F. Allen
出处
期刊:International Journal of Intelligent Systems [Wiley]
卷期号:6 (4): 341-355 被引量:274
标识
DOI:10.1002/int.4550060403
摘要

International Journal of Intelligent SystemsVolume 6, Issue 4 p. 341-355 Article Time and time again: The many ways to represent time James F. Allen, James F. Allen Department of Computer Science, the University of Rochester, Rochester, New York 14627Search for more papers by this author James F. Allen, James F. Allen Department of Computer Science, the University of Rochester, Rochester, New York 14627Search for more papers by this author First published: July 1991 https://doi.org/10.1002/int.4550060403Citations: 150AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Abstract 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. Citing Literature Volume6, Issue4Special Issue: Temporal Reasoning. Part AJuly 1991Pages 341-355 RelatedInformation
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Breath发布了新的文献求助30
1秒前
LabRat完成签到 ,获得积分10
5秒前
Ben完成签到,获得积分10
6秒前
Ava应助zzz采纳,获得10
9秒前
852应助真三采纳,获得10
10秒前
fst发布了新的文献求助10
12秒前
Reese完成签到 ,获得积分10
12秒前
所所应助yuaaaann采纳,获得50
15秒前
墨墨完成签到,获得积分10
16秒前
1DDDDD发布了新的社区帖子
19秒前
Pearl应助阿滕采纳,获得10
21秒前
fst完成签到,获得积分10
23秒前
蔡雨岑完成签到 ,获得积分10
24秒前
saberLee完成签到,获得积分10
30秒前
lelucermaire发布了新的文献求助10
35秒前
flee完成签到,获得积分10
38秒前
38秒前
娇娇大王完成签到,获得积分10
42秒前
43秒前
雄哥关注了科研通微信公众号
47秒前
21完成签到 ,获得积分10
48秒前
谢健完成签到 ,获得积分10
48秒前
从容芮应助flee采纳,获得30
48秒前
外向梨愁完成签到 ,获得积分20
53秒前
慕青应助科研通管家采纳,获得10
1分钟前
Orange应助科研通管家采纳,获得10
1分钟前
科目三应助科研通管家采纳,获得10
1分钟前
天天快乐应助科研通管家采纳,获得10
1分钟前
搜集达人应助科研通管家采纳,获得10
1分钟前
隐形曼青应助科研通管家采纳,获得10
1分钟前
CipherSage应助科研通管家采纳,获得10
1分钟前
丘比特应助科研通管家采纳,获得10
1分钟前
1分钟前
Dusk大寺柯完成签到 ,获得积分10
1分钟前
鳗鱼三毒发布了新的文献求助10
1分钟前
TOM龙完成签到,获得积分10
1分钟前
星海完成签到,获得积分10
1分钟前
Nicole完成签到,获得积分10
1分钟前
xiaoqianqian174完成签到,获得积分10
1分钟前
1分钟前
高分求助中
LNG地下式貯槽指針(JGA Guideline-107)(LNG underground storage tank guidelines) 1000
Second Language Writing (2nd Edition) by Ken Hyland, 2019 1000
Generalized Linear Mixed Models 第二版 1000
rhetoric, logic and argumentation: a guide to student writers 1000
QMS18Ed2 | process management. 2nd ed 1000
Asymptotically optimum binary codes with correction for losses of one or two adjacent bits 800
Operative Techniques in Pediatric Orthopaedic Surgery 510
热门求助领域 (近24小时)
化学 医学 材料科学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 免疫学 细胞生物学 电极
热门帖子
关注 科研通微信公众号,转发送积分 2923471
求助须知:如何正确求助?哪些是违规求助? 2568831
关于积分的说明 6941912
捐赠科研通 2223517
什么是DOI,文献DOI怎么找? 1181936
版权声明 588950
科研通“疑难数据库(出版商)”最低求助积分说明 578406