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

2008 15th International Symposium on Temporal Representation and Reasoning最新文献

筛选
英文 中文
Temporal Description Logics: A Survey 时间描述逻辑:综述
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.14
C. Lutz, F. Wolter, M. Zakharyaschev
{"title":"Temporal Description Logics: A Survey","authors":"C. Lutz, F. Wolter, M. Zakharyaschev","doi":"10.1109/TIME.2008.14","DOIUrl":"https://doi.org/10.1109/TIME.2008.14","url":null,"abstract":"We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfiability problem and algorithms for deciding it.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121645082","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}
引用次数: 240
Moving Spaces 移动的空间
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.9
I. Düntsch, M. Winter
{"title":"Moving Spaces","authors":"I. Düntsch, M. Winter","doi":"10.1109/TIME.2008.9","DOIUrl":"https://doi.org/10.1109/TIME.2008.9","url":null,"abstract":"Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed contact structures. We study their canonical models using topological spaces. As the main contribution we prove a general representation theorem for this kind of algebras.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132860101","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
Towards a Formal Framework for Spatio-Temporal Granularities 面向时空粒度的形式化框架
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.16
A. Belussi, Combi Carlo, G. Pozzani
{"title":"Towards a Formal Framework for Spatio-Temporal Granularities","authors":"A. Belussi, Combi Carlo, G. Pozzani","doi":"10.1109/TIME.2008.16","DOIUrl":"https://doi.org/10.1109/TIME.2008.16","url":null,"abstract":"In the spatial context, the research community has not reached yet a widely accepted definition of granularity. There are relatively few papers about \"spatial granularities \" and many of them give different definitions and often refer to different interpretations of the term \"spatial granularity\". In this work we propose a formal definition of \"spatial granularity\" and other related terms involved in the spatial context, as happened for the temporal one. After that, we will merge together our framework for spatial granularity with the usual framework for temporal granularity, giving a definition of spatio-temporal granularity able to manage information about spatial granularities changing over time.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128581720","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}
引用次数: 17
TLP-GP: Solving Temporally-Expressive Planning Problems TLP-GP:解决时间表达计划问题
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.19
F. Maris, P. Régnier
{"title":"TLP-GP: Solving Temporally-Expressive Planning Problems","authors":"F. Maris, P. Régnier","doi":"10.1109/TIME.2008.19","DOIUrl":"https://doi.org/10.1109/TIME.2008.19","url":null,"abstract":"This article describes an algorithm which solves temporally-expressive planning problems, that is problems for which all possible solutions require concurrency of actions. The planner TLP-GP which implements this algorithm constructs a simplified planning graph until the goals are attained, as in classic atemporal planners. It then establishes temporal constraints between actions and searches backward for a solution-plan in the planning graph using a disjunctive temporal constraint solver. If the search fails, the graph is extended to the next level and the search is restarted. This method can solve problems in a language whose expressivity is greater than PDDL 2.1. Preconditions can be required and effects can take place on any temporal interval relative to the start-time of an action. This algorithm can also take into account, in a very natural way, exogenous events as well as temporally extended goals. We also propose several different means of extending expressivity even further. TLP-GP is complete for the temporally-expressive sublanguages of PDDL 2.1. We compared our planner with two state-of-the-art temporally-expressive planners such as LPGP and VHPOP. These experimental trials not only show the efficiency of our approach but also demonstrate the practical possibility of solving temporally expressive problems which up until now were unsolvable by existing techniques.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121538826","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
The Complexity of  CaRet + Chop CaRet + Chop的复杂性
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.27
L. Bozzelli
{"title":"The Complexity of  CaRet + Chop","authors":"L. Bozzelli","doi":"10.1109/TIME.2008.27","DOIUrl":"https://doi.org/10.1109/TIME.2008.27","url":null,"abstract":".We investigate the complexity of satisfiability and pushdown model-checking of the extension of the logic CaRet with the binary regular modality 'Chop'. We present automata-theoretic decision procedures based on a direct and compositional construction, which for finite (resp., infinite) words require time of exponential height equal to the nesting depth of chop modality plus one (resp., plus two). Moreover, we provide lower bounds which match the upper bounds for the case of finite words.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127677798","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}
引用次数: 25
A Labeled Tableaux System for the Distributed Temporal Logic DTL 分布式时间逻辑DTL的标记表系统
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.21
D. Basin, Carlos Caleiro, J. Ramos, L. Viganò
{"title":"A Labeled Tableaux System for the Distributed Temporal Logic DTL","authors":"D. Basin, Carlos Caleiro, J. Ramos, L. Viganò","doi":"10.1109/TIME.2008.21","DOIUrl":"https://doi.org/10.1109/TIME.2008.21","url":null,"abstract":"DTL is a distributed temporal logic for reasoning about temporal properties of distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labeled tableaux system for future-time DTL. To achieve this, we first formalize a labeled tableaux system for reasoning locally at each agent, which provides a system for full future-time LTL, and afterwards we combine the local systems into a global one by adding rules that capture the distributed nature of DTL.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114975114","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 Greedy Approach Towards Parsimonious Temporal Aggregation 收敛时间聚合的贪心方法
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.24
J. Gordevičius, J. Gamper, Michael H. Böhlen
{"title":"A Greedy Approach Towards Parsimonious Temporal Aggregation","authors":"J. Gordevičius, J. Gamper, Michael H. Böhlen","doi":"10.1109/TIME.2008.24","DOIUrl":"https://doi.org/10.1109/TIME.2008.24","url":null,"abstract":"Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instant t is computed from the tuples that hold at t. ITA considers the distribution of the input data and works at the smallest time granularity, but the result size depends on the input timestamps and can get twice as large as the input relation. In span temporal aggregation (STA) the user specifies the timestamps over which the aggregates are computed and thus controls the result size. In this paper we introduce a new temporal aggregation operator, called greedy parsimonious temporal aggregation (PTAg), which combines features from ITA and STA. The operator extends and approximates ITA by greedily merging adjacent tuples with similar aggregate values until the number of result tuples is sufficiently small, which can be controlled by the application. Thus, PTAg considers the distribution of the data and allows to control the result size. Our empirical evaluation on real world data shows good results: considerable reductions of the result size introduce small errors only.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121638828","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
Efficient Similarity Join of Large Sets of Moving Object Trajectories 大运动目标轨迹集的高效相似连接
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.25
Hui Ding, Goce Trajcevski, P. Scheuermann
{"title":"Efficient Similarity Join of Large Sets of Moving Object Trajectories","authors":"Hui Ding, Goce Trajcevski, P. Scheuermann","doi":"10.1109/TIME.2008.25","DOIUrl":"https://doi.org/10.1109/TIME.2008.25","url":null,"abstract":"We address the problem of performing efficient similarity join for large sets of moving objects trajectories. Unlike previous approaches which use a dedicated index in a transformed space, our premise is that in many applications of location-based services, the trajectories are already indexed in their native space, in order to facilitate the processing of common spatio-temporal queries, e.g., range, nearest neighbor etc. We introduce a novel distance measure adapted from the classic Frechet distance, which can be naturally extended to support lower/upper bounding using the underlying indices of moving object databases in the native space. This, in turn, enables efficient implementation of various trajectory similarity joins. We report on extensive experiments demonstrating that our methodology provides performance speed-up of trajectory similarity join by more than 50% on average, while maintaining effectiveness comparable to the well-known approaches for identifying trajectory similarity based on time-series analysis.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131301128","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}
引用次数: 58
Decomposition of Decidable First-Order Logics over Integers and Reals 整数和实数上可定一阶逻辑的分解
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.22
F. Bouchy, A. Finkel, Jérôme Leroux
{"title":"Decomposition of Decidable First-Order Logics over Integers and Reals","authors":"F. Bouchy, A. Finkel, Jérôme Leroux","doi":"10.1109/TIME.2008.22","DOIUrl":"https://doi.org/10.1109/TIME.2008.22","url":null,"abstract":"We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our decomposition splits a logic into two parts : one integer, and one decimal (i.e. on the interval [0,1]). We also give a basis for an implementation of our representation.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896028","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
Representing Public Transport Schedules as Repeating Trips 将公共交通时刻表表示为重复行程
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.26
Romans Kasperovics, Michael H. Böhlen, J. Gamper
{"title":"Representing Public Transport Schedules as Repeating Trips","authors":"Romans Kasperovics, Michael H. Böhlen, J. Gamper","doi":"10.1109/TIME.2008.26","DOIUrl":"https://doi.org/10.1109/TIME.2008.26","url":null,"abstract":"The movement in public transport networks is organized according to schedules. The real-world schedules are specified by a set of periodic rules and a number of irregularities from these rules. The irregularities appear as cancelled trips or additional trips on special occasions such as public holidays, strikes, cultural events, etc. Under such conditions, it is a challenging problem to capture real-world schedules in a concise way. This paper presents a practical approach for modelling real-world public transport schedules. We propose a new data structure, called repeating trip, that combines route information and the schedule at the starting station of the route; the schedules at other stations can be inferred. We define schedules as semi-periodic temporal repetitions, and store them as pairs of rules and exceptions. Both parts are represented in a tree structure, termed multislice, which can represent finite and infinite periodic repetitions. We illustrate our approach on a real-world schedule and we perform in-depth comparison with related work.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121629701","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学术官方微信