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

Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)最新文献

筛选
英文 中文
Reasoning with sequences of point events 用点事件序列推理
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555672
Rattana Wetprasit, A. Sattar, L. Khatib
{"title":"Reasoning with sequences of point events","authors":"Rattana Wetprasit, A. Sattar, L. Khatib","doi":"10.1109/TIME.1996.555672","DOIUrl":"https://doi.org/10.1109/TIME.1996.555672","url":null,"abstract":"Proposes the modeling of recurring events as multi-point events by extending Vilain and Kautz's (1986) point algebra. We then propose an exact algorithm, based on van Beek's (1990) exact algorithm, for finding feasible relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special cases for which our multi-point based algorithm can find an exact solution. Finally, we summarise our paper with brief discussion on ongoing and future research.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123252476","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}
引用次数: 5
A general framework and reasoning models for time granularity 时间粒度的一般框架和推理模型
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555688
C. Bettini, X. Wang, S. Jajodia
{"title":"A general framework and reasoning models for time granularity","authors":"C. Bettini, X. Wang, S. Jajodia","doi":"10.1109/TIME.1996.555688","DOIUrl":"https://doi.org/10.1109/TIME.1996.555688","url":null,"abstract":"This paper presents a general framework to define time granularity systems. We identify the main choices differentiating the systems and investigate the formal relationships among granularities in these systems. The paper also introduces the notion of a network of temporal constraints with granularities emphasizing the semantical and computational differences from constraint networks with a single granularity. Consistency is shown to be NP-hard and an approximate algorithm proposed.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124675891","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}
引用次数: 39
Engineering time in medical knowledge-based systems through time-axes and time-objects 通过时间轴和时间对象在医学知识系统中的工程时间
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555695
E. Keravnou
{"title":"Engineering time in medical knowledge-based systems through time-axes and time-objects","authors":"E. Keravnou","doi":"10.1109/TIME.1996.555695","DOIUrl":"https://doi.org/10.1109/TIME.1996.555695","url":null,"abstract":"Starting from the premise that time representation and temporal reasoning must constitute integral aspects of a competent, knowledge-based, medical system, the paper presents the relevant requirements and discusses their realisation in terms of a generic temporal kernel to be embedded in such a system. The kernel has a layered architecture where the bottom layer gives the ontological primitives and their associated axioms, and the higher layers implement the required temporal reasoning. The principal primitives of the ontology are the time-axis and the time-object.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124190884","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}
引用次数: 11
Temporal representation for multimedia systems 多媒体系统的时态表示
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555701
Minglu Li, Yongqiang Sun, H. Sheng
{"title":"Temporal representation for multimedia systems","authors":"Minglu Li, Yongqiang Sun, H. Sheng","doi":"10.1109/TIME.1996.555701","DOIUrl":"https://doi.org/10.1109/TIME.1996.555701","url":null,"abstract":"The paper focuses on temporal representation for multimedia systems. On the basis of an interval-based indeterministic synchronization model the authors propose a new generalized synchronization model (GSM), which has fewer, more powerful interval operators. They then outline a description language paradigm as a preferred approach to specify multimedia systems, and present a new Multimedia Synchronization Description Language (MSDL), which is based on the GSM. Additionally, they demonstrate how the MSDL can be used to describe a large number of present and future multimedia systems.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116035501","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}
引用次数: 0
Combining simultaneous values and temporal data dependencies 结合同时值和临时数据依赖项
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555689
A. Gal, D. Dori
{"title":"Combining simultaneous values and temporal data dependencies","authors":"A. Gal, D. Dori","doi":"10.1109/TIME.1996.555689","DOIUrl":"https://doi.org/10.1109/TIME.1996.555689","url":null,"abstract":"In temporal databases there are situations where multiple values of the same data item have overlapping validity times. In addition to the common case of multi-valued properties, there are several possible semantics to multiple values with overlapping validity times of the same data item. We refer to such data items as having simultaneous values. This paper presents a polynomial algorithm for efficient handling of simultaneous values in a database with temporal data dependencies-integrity rules that define relationships among values of different dated items in a temporal database. The algorithm is demonstrated using a case study from the game theory area. An implementation of the algorithm is integrated in a prototype of a temporal active database.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298225","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
Processing disjunctions of temporal constraints 时间约束的加工中断
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555671
Eddie Schwalb, R. Dechter
{"title":"Processing disjunctions of temporal constraints","authors":"Eddie Schwalb, R. Dechter","doi":"10.1109/TIME.1996.555671","DOIUrl":"https://doi.org/10.1109/TIME.1996.555671","url":null,"abstract":"Describes new algorithms for processing quantitative temporal constraint satisfaction problems (TCSPs). In contrast to discrete CSPs, enforcing path consistency on TCSPs is exponential due to the fragmentation problem. We present an efficient polynomial constraint propagation algorithm, called \"loose-path consistency\" (LPC), which is shown to improve the performance of backtrack search algorithms by orders of magnitude. The tradeoffs between the effectiveness and efficiency of LPC are analyzed. We report the presence of a phase transition on this domain and perform an empirical evaluation on problems which lie in the transition region.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125307325","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 theory of time and temporal incidence based on instants and periods 以瞬间和周期为基础的时间和时间发生的理论
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555670
L. Vila, Eddie Schwalb
{"title":"A theory of time and temporal incidence based on instants and periods","authors":"L. Vila, Eddie Schwalb","doi":"10.1109/TIME.1996.555670","DOIUrl":"https://doi.org/10.1109/TIME.1996.555670","url":null,"abstract":"Time is fundamental in representing and reasoning about changing domains. A proper temporal representation requires characterizing two notions: (1) time itself, and (2) temporal incidence, i.e. the domain-independent properties for the truth-value of fluents and events throughout time. There are some problematic issues, such as the expression of instantaneous events and instantaneous holding of fluents, the specification of the properties for the temporal holding of fluents, and the \"dividing instant problem\". This paper presents a theory of time and temporal incidence which is more natural than its predecessors and satisfactorily addresses the issues above. Our theory of time, called /spl Iscr//spl Pscr/ (Instants and Periods), is based on having instants and periods at equal levels. We define a theory of temporal incidence upon it, whose main original feature is the distinction between continuous and discrete fluents.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122416830","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}
引用次数: 30
Hybrid temporal reasoning for planning and scheduling 计划和调度的混合时间推理
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555674
S. Badaloni, M. Berati
{"title":"Hybrid temporal reasoning for planning and scheduling","authors":"S. Badaloni, M. Berati","doi":"10.1109/TIME.1996.555674","DOIUrl":"https://doi.org/10.1109/TIME.1996.555674","url":null,"abstract":"This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal information and their complexity.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132924719","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
Using temporal logics for planning and control 使用时间逻辑进行计划和控制
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555666
F. Bacchus
{"title":"Using temporal logics for planning and control","authors":"F. Bacchus","doi":"10.1109/TIME.1996.555666","DOIUrl":"https://doi.org/10.1109/TIME.1996.555666","url":null,"abstract":"Traditionally, planning work in artificial intelligence has focused on primitive actions and instantaneous states. Innovative work has been done on composing primitive actions so as to bring about desired final states. The thesis advanced in this paper is that instead of simply focusing on primitive actions, it is also useful to use representation and reasoning tools whose primitive objects are sequences of actions (or the associated sequences of states that they generate). Temporal logics are a useful tool for representing and reasoning about action sequences. The author has examined some different applications of temporal logics to problems of planning and control.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133539835","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
Temporal resolution: a breadth-first search approach 时间分辨率:宽度优先搜索方法
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555690
C. Dixon
{"title":"Temporal resolution: a breadth-first search approach","authors":"C. Dixon","doi":"10.1109/TIME.1996.555690","DOIUrl":"https://doi.org/10.1109/TIME.1996.555690","url":null,"abstract":"An approach to applying clausal resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution between states. The method consists of only one temporal resolution rule and is therefore particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of this temporal resolution rule is the most costly part of the method, involving search amongst graphs, it is on this area we focus. A breadth-first search approach to the application of this rule is presented and shown to be correct. Analysis of its operation is carried out and test results for its comparison to a previously developed depth-first style algorithm given.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123494144","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}
引用次数: 2
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信