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

Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001最新文献

筛选
英文 中文
A temporal logic for reasoning about timed concurrent constraint programs 时间并发约束程序的时间逻辑推理
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930721
F. S. Boer, M. Gabbrielli, M. Meo
{"title":"A temporal logic for reasoning about timed concurrent constraint programs","authors":"F. S. Boer, M. Gabbrielli, M. Meo","doi":"10.1109/TIME.2001.930721","DOIUrl":"https://doi.org/10.1109/TIME.2001.930721","url":null,"abstract":"A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on epistemic modalities which express either what a process knows at a certain time or what a process believes about the results of the other processes. In terms of these epistemic modalities of \"knowledge \" and \"belief\" a compositional axiomatization is given of the reactive behaviour of timed concurrent constraint programs.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114902989","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
Representing periodic temporal information with automata 用自动机表示周期性时间信息
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930715
P. Wolper
{"title":"Representing periodic temporal information with automata","authors":"P. Wolper","doi":"10.1109/TIME.2001.930715","DOIUrl":"https://doi.org/10.1109/TIME.2001.930715","url":null,"abstract":"Motivated by issues in temporal databases and in the verification of infinite-state systems, this talk considers the problem of representing periodic dense time information. Doing so requires handling a theory that combines discrete and continuous variables, since discrete variables are essential for representing periodicity. An automata-based approach for dealing with such a combined theory is thus introduced. This approach uses the fact that real numbers can be represented by infinite sequences of digits and hence that sets of real numbers can be viewed as infinite-word languages, which can be recognized by infinite-word finite automata. Since these automata can represent all linear constraints, can express intergerhood, and are closed under the firstorder constructs, the presented approach can handle the full first-order theory of linear constraints over the reals and integers. One problem with using infinite-word automata is that the algorithms for complementing them are especially complicated and difficult to implement effectively. Fortunately, with the help of topological arguments it can be shown that a very restricted and much more tractable class of infiniteword automata are sufficient for the purpose on hand. Background information on the topics presented in this talk can be found in [1, 2, 3, 4].","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894012","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 tableau queries 时态表查询
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930709
J. Wijsen, A. Bès
{"title":"Temporal tableau queries","authors":"J. Wijsen, A. Bès","doi":"10.1109/TIME.2001.930709","DOIUrl":"https://doi.org/10.1109/TIME.2001.930709","url":null,"abstract":"The tableau construct plays a very important role in relational-database theory. The paper shows how this construct can be extended for tuple-timestamped relations. The expressive power of temporal tableau queries is compared with that of a temporal algebra. A temporal extension of the homomorphism theorem is given.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117128866","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
Deciding LTL over Mazurkiewicz traces 在Mazurkiewicz轨迹上确定LTL
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930717
B. Bollig, M. Leucker
{"title":"Deciding LTL over Mazurkiewicz traces","authors":"B. Bollig, M. Leucker","doi":"10.1109/TIME.2001.930717","DOIUrl":"https://doi.org/10.1109/TIME.2001.930717","url":null,"abstract":"Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield further on-the-fly model checking procedures. In this paper we exhibit a decision procedure for LTL over Mazurkiewicz traces which generalises the classical automata-theoretic approach to a linear time temporal logic interpreted no longer over sequences but certain partial orders. Specifically, we construct a (linear) alternating Buchi automaton accepting the set of linearisations of traces satisfying the formula at hand. The salient point of our technique is to apply a notion of independence-rewriting to formulas of the logic. Furthermore, we show that the class of linear and trace-consistent alternating Buchi automata corresponds exactly to LTL formulas over Mazurkiewicz traces, lifting a similar result from Loding and Thomas formulated in the framework of LTL over words.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125893308","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}
引用次数: 23
A query calculus for spatio-temporal object databases 时空对象数据库的查询演算
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930705
Tony Griffiths, A. Fernandes, N. Djafri, N. Paton
{"title":"A query calculus for spatio-temporal object databases","authors":"Tony Griffiths, A. Fernandes, N. Djafri, N. Paton","doi":"10.1109/TIME.2001.930705","DOIUrl":"https://doi.org/10.1109/TIME.2001.930705","url":null,"abstract":"The development of any comprehensive proposal for spatio-temporal databases involves significant extensions to many aspects of a non-spatio-temporal architecture. One aspect that has received less attention than most is the development of a query calculus that can be used to provide a semantics for spatio-temporal queries and underpin an effective query optimization and evaluation framework. We show how a query calculus for spatio-temporal object databases that builds upon the monoid calculus proposed by Fegaras and Maier (2000) for ODMG-compliant database systems can be developed. The paper shows how an extension of the ODMG type system with spatial and temporal types can be accommodated into the monoid approach. It uses several queries over historical (possibly spatial) data to illustrate how, by mapping them into monoid comprehensions, the way is open for the application of a logical optimizer based on the normalization algorithm proposed by Fegaras and Maier.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129616377","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}
引用次数: 16
Representing temporal interval relationships in a first order logic for time 用时间的一阶逻辑表示时间间隔关系
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930702
A. Trudel
{"title":"Representing temporal interval relationships in a first order logic for time","authors":"A. Trudel","doi":"10.1109/TIME.2001.930702","DOIUrl":"https://doi.org/10.1109/TIME.2001.930702","url":null,"abstract":"We present a simple classification of temporal information based on truth value at the point level. Axioms are then derived for capturing temporal relationships and, strong and weak negation. The main advantage of our logic independent approach is that it becomes simpler for a user to define a first order temporal logic.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127190405","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
Cellular ontology as a basis for spatiotemporal reasoning 细胞本体作为时空推理的基础
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930690
E. Sandewall
{"title":"Cellular ontology as a basis for spatiotemporal reasoning","authors":"E. Sandewall","doi":"10.1109/TIME.2001.930690","DOIUrl":"https://doi.org/10.1109/TIME.2001.930690","url":null,"abstract":"A logic for reasoning about dynamic systems should be defined on three levels. The material level is expressed in quantitative terms, the image level defines models in terms of discrete mathematics, and the logic level defines the logical language and deduction system. Consider the problem of guiding a vehicle that has to move within severe spatial constraints. For a simple version of a cellular ontology, the material level is a 2D surface where vehicles move along trajectories formed from straight-line segments and circular arcs which are each others' tangents at the points of transition. The image level is obtained by dividing the surface into equally-sized cells, which may be, for example, quadratic or hexagonal. For a given cell structure, with a finite set of ports and a finite set of orientations, and allowing also for some restrictions on vehicle movements, we obtain a finite set of possible maneuvers. It is therefore possible to calculate in advance a qualitative information structure that can be used for analyzing and planning the movements of a vehicle in the cellular driving space.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122443788","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
Reasoning about agents in the KARO framework 在KARO框架中推理agent
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930719
U. Hustadt, C. Dixon, R. Schmidt, Michael Fisher, J. Meyer, W. Hoek
{"title":"Reasoning about agents in the KARO framework","authors":"U. Hustadt, C. Dixon, R. Schmidt, Michael Fisher, J. Meyer, W. Hoek","doi":"10.1109/TIME.2001.930719","DOIUrl":"https://doi.org/10.1109/TIME.2001.930719","url":null,"abstract":"This paper proposes two methods for realising automated reasoning about agent-based systems. The framework for modelling intelligent agent behaviour that we focus on is a core of KARO logic, an expressive combination of various modal logics including propositional dynamic logic, a modal logic of knowledge, a modal logic of wishes, and additional non-standard operators. The first method we present is based on a translation of core KARO logic to first-order logic combined with first-order resolution. The second method uses an embedding of core KARO logic into a combination of branching-time temporal logic CTL and multi-modal S5 plus a clausal resolution calculus for these combined logics. We discuss the advantages and shortcomings of each approach and suggest ways to extend each variant to cover more of the KARO framework.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122810077","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}
引用次数: 19
Approximate query evaluation using linear constraint databases 使用线性约束数据库的近似查询评估
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930714
P. Revesz, R. Chen, M. Ouyang
{"title":"Approximate query evaluation using linear constraint databases","authors":"P. Revesz, R. Chen, M. Ouyang","doi":"10.1109/TIME.2001.930714","DOIUrl":"https://doi.org/10.1109/TIME.2001.930714","url":null,"abstract":"This paper shows that constraint databases can be used for the approximation of several types of discretely recorded continuous data, for example time series data and some spatio-temporal geographic data. We show that time series data can be approximated by a piecewise linear approximation that runs in linear time in the number of data points, and the piecewise linear approximation can be represented in a linear constraint database. Similarly, the spatio-temporal geographic data that is composed of a set of spatial locations, where each location is associated with a time series, can be also approximated and represented in a linear constraint database. The approximations provide data compression, faster query evaluation-that preserve high precision and recall-and interpolation enabling the evaluation of queries that could not be evaluated before.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123606414","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
Optimizing temporal queries: efficient handling of duplicates 优化时态查询:有效地处理重复项
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001 Pub Date : 2001-06-14 DOI: 10.1109/TIME.2001.930704
Ivan T. Bowman, David Toman
{"title":"Optimizing temporal queries: efficient handling of duplicates","authors":"Ivan T. Bowman, David Toman","doi":"10.1109/TIME.2001.930704","DOIUrl":"https://doi.org/10.1109/TIME.2001.930704","url":null,"abstract":"Recent research in the area of temporal databases has proposed a number of query languages that vary in their expressive power and the semantics they provide to users. These query languages represent a spectrum of solutions to the tension between clean semantics and efficient evaluation. Often, these query languages are implemented by translating temporal queries into standard relational queries. However, the compiled queries are often quite cumbersome and expensive to execute even using state-of-the-art relational products. The paper presents an optimization technique that produces more efficient translated SQL queries by taking into account the properties of the encoding used for temporal attributes. For concreteness, this translation technique is presented in the context of SQL/TP; however these techniques are also applicable to other temporal query languages.","PeriodicalId":312761,"journal":{"name":"Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121697921","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
下一页 尾页
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学术官方微信