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

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

筛选
英文 中文
A topological transition based logic for the qualitative motion of objects 一种基于拓扑转换的物体定性运动逻辑
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555697
A. Trudel, D. Gagné
{"title":"A topological transition based logic for the qualitative motion of objects","authors":"A. Trudel, D. Gagné","doi":"10.1109/TIME.1996.555697","DOIUrl":"https://doi.org/10.1109/TIME.1996.555697","url":null,"abstract":"The authors present a spatio-temporal ontology suitable for representing and reasoning about the qualitative motion of rigid bodies. This simple ontology provides a uniform treatment of motion in one, two, and three dimensional space. A succinct axiomatization is provided capturing the ontology. This first order logic is based on the transition of topological relations between objects.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"23 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":"115441268","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}
引用次数: 4
Logic programming with temporal constraints 具有时间约束的逻辑编程
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555679
Eddie Schwalb, L. Vila
{"title":"Logic programming with temporal constraints","authors":"Eddie Schwalb, L. Vila","doi":"10.1109/TIME.1996.555679","DOIUrl":"https://doi.org/10.1109/TIME.1996.555679","url":null,"abstract":"Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal constraint networks are applied. We identify a decidable fragment called Simple TCLP, which can be viewed as extending Datalog with limited functions to accommodate intervals of occurrence and temporal constraints between them. Some of the restrictions introduced by Simple TCLP are overcome by a syntactic structure which provides it with the benefits of reification. The latter allows quantification on temporal occurrences and relation symbols.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"67 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":"123572499","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
Representing interaction of agents at different time granularities 表示agent在不同时间粒度上的交互作用
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555684
E. Mota, D. Robertson
{"title":"Representing interaction of agents at different time granularities","authors":"E. Mota, D. Robertson","doi":"10.1109/TIME.1996.555684","DOIUrl":"https://doi.org/10.1109/TIME.1996.555684","url":null,"abstract":"In this paper we describe NatureTime logic which we use to represent and reason about the behaviour of interacting agents (in an ecological domain), which behave at different time granularities. Although the traditional application fields of temporal representation and reasoning still raise many interesting theoretical issues, we have been investigating some practical problems of ecological systems which suit different representations of time than those embodied in traditional simulation models of ecosystems. These seem well suited to reconstruction using temporal logic programs.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"28 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":"124631165","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}
引用次数: 9
Temporal reasoning in a meta constraint logic programming architecture 元约束逻辑编程体系结构中的时间推理
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555691
E. Lamma, P. Mello, M. Milano
{"title":"Temporal reasoning in a meta constraint logic programming architecture","authors":"E. Lamma, P. Mello, M. Milano","doi":"10.1109/TIME.1996.555691","DOIUrl":"https://doi.org/10.1109/TIME.1996.555691","url":null,"abstract":"Constraint Logic Programming (CLP) is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an \"arc consistency\" propagation algorithm which cannot be changed by the user and it is too weak in many temporal frameworks. Second, CLP is not able to deal with qualitative temporal constraints. In this paper, we show how to overcome these limitations. In particular, we present a way of performing a path-consistency check without changing the propagation algorithm of the constraint solver. In addition, we show how to integrate qualitative and quantitative temporal reasoning by using a two module meta CLP architecture. Each module is a finite domain constraint solver (CLP(FD)). The object system (extended with the path-consistency algorithm) performs quantitative reasoning, while the meta-level reasons on constraints of the underlying system thus performing qualitative reasoning. In this way, we can benefit of the efficiency of the constraint handling mechanism of CLP and the modularity, flexibility and scalability of meta-architectures.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"48 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":"121959272","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}
引用次数: 4
An integrity constraint checking method for temporal deductive databases 一种时间演绎数据库的完整性约束检验方法
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555692
Carme Martín, J. Sistac
{"title":"An integrity constraint checking method for temporal deductive databases","authors":"Carme Martín, J. Sistac","doi":"10.1109/TIME.1996.555692","DOIUrl":"https://doi.org/10.1109/TIME.1996.555692","url":null,"abstract":"The authors propose a method for integrity checking in the context of temporal deductive databases. A temporal deductive database is a deductive database that supports some aspect of time, in our case valid time, in which valid time is the time when the fact is true in the modelled reality. Their method augments a database with a set of transition and event rules, which explicitly define the insertions and deletions by database update. Standard SLDNF resolution can then be used to check satisfaction of integrity constraints. A temporal deductive database has to be consistent, that is, after performing an update the database must satisfy its set of integrity constraints. Using their method the temporal deductive database is always consistent because if a retroactive or proactive update violated some integrity constraint the update would be rejected.","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":"129592782","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}
引用次数: 6
A modal temporal logic and its models underlying variants of planning algorithms 模态时间逻辑及其模型是规划算法的基础
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555698
K. Jantke, O. Arnold
{"title":"A modal temporal logic and its models underlying variants of planning algorithms","authors":"K. Jantke, O. Arnold","doi":"10.1109/TIME.1996.555698","DOIUrl":"https://doi.org/10.1109/TIME.1996.555698","url":null,"abstract":"The focus of the paper is on the introduction of some modal temporal logic and its application to knowledge processing under the particularly difficult circumstances of disturbed complex dynamic processes. The development of this logic has been driven by the overall approach to knowledge-based process supervision and control. Within this comprehensive approach, therapy control is playing a crucial role. The therapy control concept comprises the generation of therapy or repair plans, plan execution and constraint monitoring and includes plan revision. The incompleteness and vagueness of available information about an accidentally disturbed process requires a particularly tailored logical approach. The basic concepts are introduced and exploited for developing a collection of planning algorithms properly exceeding previous approaches.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"34 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":"121937874","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}
引用次数: 8
Gaining efficiency and flexibility in the simple temporal problem 在简单的时间问题中获得效率和灵活性
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555676
A. Cesta, A. Oddi
{"title":"Gaining efficiency and flexibility in the simple temporal problem","authors":"A. Cesta, A. Oddi","doi":"10.1109/TIME.1996.555676","DOIUrl":"https://doi.org/10.1109/TIME.1996.555676","url":null,"abstract":"Deals with the problem of managing quantitative temporal networks without disjunctive constraints. This problem is known as the \"simple temporal problem\". Dynamic management algorithms are considered to be coupled with incremental constraint posting approaches for planning and scheduling. A basic algorithm for incremental propagation of a new time constraint is presented which is a modification of the Bellman-Ford algorithm for the single-source shortest-path problem. For this algorithm, a sufficient condition for inconsistency is given, based on cycle detection in the shortest-paths graph. Moreover, the problem of constraint retraction from a consistent situation is considered, and properties for repropagating the network locally are exploited. Some experiments are also presented that show the usefulness of these properties.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"302 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":"121962155","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}
引用次数: 100
Characterizing temporal repetition 表征时间重复
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555685
D. Cukierman, J. Delgrande
{"title":"Characterizing temporal repetition","authors":"D. Cukierman, J. Delgrande","doi":"10.1109/TIME.1996.555685","DOIUrl":"https://doi.org/10.1109/TIME.1996.555685","url":null,"abstract":"This paper is a preliminary investigation of temporal repetition. We review work in Artificial Intelligence of both formal and practical systems that deal with repetitive temporal objects (i.e. repetitive points and/or intervals). We analyze the essence of repetition, and present an extensive classification of types of repetition.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"78 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":"126988213","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
Nonmonotonic reasoning on a constructive time structure 构造时间结构上的非单调推理
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555699
Akira Fusaoka
{"title":"Nonmonotonic reasoning on a constructive time structure","authors":"Akira Fusaoka","doi":"10.1109/TIME.1996.555699","DOIUrl":"https://doi.org/10.1109/TIME.1996.555699","url":null,"abstract":"The author introduces a temporal logic called interval division logic, IDL, based on the constructive temporal ontology. In IDL, time is regarded as a constructive object which is built from an interval by iterating the interval division every time a new temporal fact is recognized. IDL as a sound and complete logical system which is as expressive as the Buich tree automata. In order to examine how the persistence problem is treated on this ontology, the author extends a nonmonotonic version of IDL based on the model preference in which any belief is changed as late as possible in the epistemological order rather than the temporal order. The Yale shooting problem is discussed in this framework.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"8 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":"127939807","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
Guiding and refining simulation using temporal logic 使用时间逻辑指导和改进仿真
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI: 10.1109/TIME.1996.555693
G. Brajnik, D. Clancy
{"title":"Guiding and refining simulation using temporal logic","authors":"G. Brajnik, D. Clancy","doi":"10.1109/TIME.1996.555693","DOIUrl":"https://doi.org/10.1109/TIME.1996.555693","url":null,"abstract":"We illustrate TeQSIM, a qualitative simulator for continuous dynamical systems. It combines the expressive power of qualitative differential equations with temporal logic by interleaving simulation with model checking to constrain and refine the resulting predicted behaviors. Temporal logic expressions are used to specify constraints that restrict the simulation to a region of the state space and to specify trajectories for input variables. A propositional linear-time temporal logic is adopted, which is extended to a three valued logic that allows a formula to be conditionally entailed when quantitative information specified in the formula can be applied to a behavior to refine it. The authors present a formalization of the logic with theoretical results concerning the adopted model checking algorithm (correctness and completeness). They show also an example of the simulation of a non-autonomous dynamical system and illustrate possible application tasks, ranging from simulation to monitoring and control of continuous dynamical systems, where TeQSIM can be applied.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"30 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":"125782092","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信