发布求助
文献互助 智能选刊 最新文献

Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000最新文献

筛选
英文 中文
Reasoning about generalized intervals: Horn representability and tractability 广义区间的推理:角的可表征性和可追溯性
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856580
P. Balbiani, Jean-François Condotta, G. Ligozat
{"title":"Reasoning about generalized intervals: Horn representability and tractability","authors":"P. Balbiani, Jean-François Condotta, G. Ligozat","doi":"10.1109/TIME.2000.856580","DOIUrl":"https://doi.org/10.1109/TIME.2000.856580","url":null,"abstract":"This paper organizes the topologic forms of the possible relations between generalized intervals. Working out generalized interval algebra on the pattern of point algebra and interval algebra, it introduces the concept of Horn representability just as the one of convexity. It gives the class of Horn representable relations a simple characterization based on the concept of strong preconvexity. Adapting the propagation techniques designed to solve the networks of constraints between points or between intervals, it shows that the issue of consistency of a Horn representable generalized interval network can be solved in polynomial time by means of the weak path-consistency algorithm, a new incomplete algorithm for computing a minimal set of temporal constraints.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129443735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Representing and reasoning with temporal constraints in multimedia presentations 多媒体表示中时间约束的表示和推理
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856576
Sibel Adali, L. Console, M. Sapino, M. Schenone, P. Terenziani
{"title":"Representing and reasoning with temporal constraints in multimedia presentations","authors":"Sibel Adali, L. Console, M. Sapino, M. Schenone, P. Terenziani","doi":"10.1109/TIME.2000.856576","DOIUrl":"https://doi.org/10.1109/TIME.2000.856576","url":null,"abstract":"With the growing use of computers to create technical, business and personal presentations, there has been a huge increase in the number of multimedia presentation tools out in the market. Thus, over the coming years, there will be a growing need to build the ability to query rapidly databases consisting of interactive multimedia presentations. The MPA algebra proposed by Adali et al. provides a specification of how primitive algebraic operations on interactive multimedia presentations can be implemented. In this paper we define a temporal extension of MPA dealing with temporal constraints in the representation and in the queries. In particular, we point out the different types of (explicit and implicit) temporal constraints within a multimedia presentation and define a suitable framework in which the different types of constraints can be represented and queries (regarding also the temporal aspects) can be answered efficiently.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"100 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116013913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A formalization of structured temporal objects and repetition 结构化的时间对象和重复的形式化
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856579
D. Cukierman, J. Delgrande
{"title":"A formalization of structured temporal objects and repetition","authors":"D. Cukierman, J. Delgrande","doi":"10.1109/TIME.2000.856579","DOIUrl":"https://doi.org/10.1109/TIME.2000.856579","url":null,"abstract":"We propose an approach to formally representing structured temporal objects. These new temporal objects are recursively made up of convex intervals and Allen's convex relations. The major emphasis in our approach is on temporal repetition. To that effect we define the time loop. Time loops allow us to abstract common elements in repetitive temporal patterns. A loop is parameterized by a cycle which is a structured temporal element possibly including subloops, a relation between instances of the cycle and a repetition factor or dimension. Atemporal assertions are true during these temporal objects, and thus this formalism allows one to concisely represent and reason with assertions which have an inherent temporal structure. Hence, this formalism allows one to concisely represent, for example, the scheduling of regular meetings in a university, where meeting may in turn be composed of structured repetitive processes such as those occurring in an assembly line.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123657019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
A calculus of macro-events: progress report 宏观事件的演算:进度报告
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856584
I. Cervesato, A. Montanari
{"title":"A calculus of macro-events: progress report","authors":"I. Cervesato, A. Montanari","doi":"10.1109/TIME.2000.856584","DOIUrl":"https://doi.org/10.1109/TIME.2000.856584","url":null,"abstract":"The need for constraining the temporal relationships among sets of related events arises in several temporal reasoning tasks, including monitoring, plan validation, planning and diagnosis. Process constructors provide an effective way of packaging related events into individual conceptual chunks, called macro-events. In this paper, we present a first attempt at defining a calculus of macro-events that extends Kowalski and Sergot's (1985) event calculus with process constructors to express effects triggered by complex combinations of event occurrences. We apply this language to model the operations of a simple gas heater and present a Prolog implementation.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Is point-based semantics always adequate for temporal databases? 对于时态数据库来说，基于点的语义总是足够的吗?
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856601
P. Terenziani
{"title":"Is point-based semantics always adequate for temporal databases?","authors":"P. Terenziani","doi":"10.1109/TIME.2000.856601","DOIUrl":"https://doi.org/10.1109/TIME.2000.856601","url":null,"abstract":"The analysis of the semantics of temporal data and queries plays a central role in the area of temporal relational databases. Although many different models and algebra have been proposed, almost all of them are based on a point-based (snapshot) semantics of the association of time to tuples/attributes. On the other hand, in the areas of linguistics, philosophy, and recently, artificial intelligence, a very debated issue concerns the use of an interval-based vs. a point-based semantics. We consider a slight adaptation of TSQL2's \"consensus\" algebra and model, discuss its semantics, and show some critical aspects arisen by the adoption of a point-based semantics.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Behavior discovery as database scheme design 作为数据库方案设计的行为发现
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856592
T. Miura, I. Shioya, Kohei Watanabe
{"title":"Behavior discovery as database scheme design","authors":"T. Miura, I. Shioya, Kohei Watanabe","doi":"10.1109/TIME.2000.856592","DOIUrl":"https://doi.org/10.1109/TIME.2000.856592","url":null,"abstract":"In this investigation, we propose an inductive classification method for a collection of temporal information which mean behavior. We assume a Markov property and discuss ergodic analysis by which we can extract stationary parts of the behavior. We discuss a design methodology for database schemes based on the theory.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125020581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Estimating positions and paths of moving objects 估计移动物体的位置和路径
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856597
K. Beard, H. Palancioglu
{"title":"Estimating positions and paths of moving objects","authors":"K. Beard, H. Palancioglu","doi":"10.1109/TIME.2000.856597","DOIUrl":"https://doi.org/10.1109/TIME.2000.856597","url":null,"abstract":"Several applications require support for representing and analyzing moving objects. Such applications include wildlife tracking, emergency dispatch, vehicle navigation, fleet management, storm tracking, and military applications to name a few. Enhanced data collection technologies such as high resolution satellite imagery, videogrammetry and GPS in combination with wireless communications are rapidly increasing the feasibility of obtaining information on moving objects and fueling new research and development. In these applications there is a need to efficiently answer questions about moving objects such as where they are at a specific time, where they have been in the past, where they will be in the future, and their relationships to static or other moving objects. Complete knowledge of object movements is not possible but movements can be predicted with some degree of reliability. Positions and paths of moving objects can be estimated from a set of observations. This paper reports on an approach that uses movement profiles, and movement histories in addition to observations to more reliably estimate positions and paths of moving objects.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131864549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Free schedules for free agents in workflow systems 工作流系统中自由代理的免费时间表
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856582
C. Bettini, X. Wang, S. Jajodia
{"title":"Free schedules for free agents in workflow systems","authors":"C. Bettini, X. Wang, S. Jajodia","doi":"10.1109/TIME.2000.856582","DOIUrl":"https://doi.org/10.1109/TIME.2000.856582","url":null,"abstract":"This paper investigates workflow systems in which the enactment and completion of activities have to satisfy a set of quantitative temporal constraints. Different activities are usually performed by autonomous agents, and the scheduling of activities by the enactment service has among its goals the minimization of communication and synchronization among the agents. The paper formally defines the notion of a schedule for these workflow systems and its identifies a particularly useful class: free schedules. A schedule specifies a time range for the enactment, duration and completion of each activity in order to satisfy all the temporal constraints in the workflow. In a free schedule, an agent has to start its activity within the range specified in the schedule, but it is free to use any amount of time to finish the activity as long as it is between a minimum and maximum time he has declared when the workflow is designed. No synchronization with other agents is needed. The paper provides a method to characterize all the free schedules admitted by a workflow specification and an algorithm to derive them.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124110476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Resolution for branching time temporal logics: applying the temporal resolution rule 分支时间时间逻辑的解析:应用时间解析规则
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856598
A. Bolotov, C. Dixon
{"title":"Resolution for branching time temporal logics: applying the temporal resolution rule","authors":"A. Bolotov, C. Dixon","doi":"10.1109/TIME.2000.856598","DOIUrl":"https://doi.org/10.1109/TIME.2000.856598","url":null,"abstract":"We propose algorithms to implement a branching time temporal resolution theorem prover. The branching time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. Unlike the majority of the research into temporal logic, we adopt a resolution-based approach. The method applies step and temporal resolution rules to the set of formulae in a normal form. Whilst step resolution is similar to the classical resolution rule, the temporal resolution rule resolves a formula, /spl phi/, that must eventually occur with a set of formulae that together imply that /spl phi/ can never occur. Thus the method is dependent on the efficient detection of such sets of formulae. We present algorithms to search for these sets of formulae, give a correctness argument, and examples of their operation.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127510379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
An incremental batch-oriented index for bitemporal databases 用于双时态数据库的面向批处理的增量索引
Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI: 10.1109/TIME.2000.856594
Jefferson R. O. Silva, M. Nascimento
{"title":"An incremental batch-oriented index for bitemporal databases","authors":"Jefferson R. O. Silva, M. Nascimento","doi":"10.1109/TIME.2000.856594","DOIUrl":"https://doi.org/10.1109/TIME.2000.856594","url":null,"abstract":"Bitemporal databases record not only the history of tuples in temporal tables, but also record the history of the databases themselves. We address the problem of indexing such bitemporal databases by investigating the use of an incremental indexing structure, the HR-tree, which was originally aimed at spatiotemporal databases. The HR-tree's most attractive feature is that it can process queries as if all previous database snapshots were indexed physically, however, all such states are indexed only logically. In our experiments we have found that the HR-tree is much more efficient (up to 80% faster) than previously proposed approaches based on two coordinated R-trees when processing queries based on a single transaction time point and valid time being either point or intervals. As for size, the HR-tree was found to be better suited for workloads where the number of updates per transaction timestamp is reasonably large (over one thousand updates in our studies), otherwise it is prone to require large storage space.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信