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

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)最新文献

筛选
英文 中文
Conceptual and Metaphysical Origins and Relevance of Temporal Logic 时间逻辑的概念和形而上学起源及其相关性
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.25
David Jakobsen, P. Øhrstrøm
{"title":"Conceptual and Metaphysical Origins and Relevance of Temporal Logic","authors":"David Jakobsen, P. Øhrstrøm","doi":"10.1109/TIME.2016.25","DOIUrl":"https://doi.org/10.1109/TIME.2016.25","url":null,"abstract":"Logic has sometimes been seen as an alternative to metaphysics and to speculation. In this paper it is argued that a different story should be told when it comes to temporal logic and tense-logic in particular. A. N. Prior's first formulation of tense logic was mainly established in order to qualify the discussion of certain metaphysical and conceptual problems. Although temporal logic has now been developed in various abstract and rather technical ways, it may still serve as a great help for anyone who wants to clarify the discussion of important existential questions like the nature of time, determinism, future contingency or freedom of choice.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132197886","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
The Impact of the TelicAtelic Dichotomy on Temporal Databases Telic / Atelic二分法对时间数据库的影响
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.33
P. Terenziani
{"title":"The Impact of the TelicAtelic Dichotomy on Temporal Databases","authors":"P. Terenziani","doi":"10.1109/TIME.2016.33","DOIUrl":"https://doi.org/10.1109/TIME.2016.33","url":null,"abstract":"The telicatelic distinction, first introduced by Aristotle in his Categories [1], has a long tradition in the Western culture. Prior research in philosophy, linguistics, cognitive science, artificial intelligence and other areas suggests the need to differentiate between temporal facts with goal-related semantics (i.e., telic) from those that are intrinsically devoid of goalculmination (i.e., atelic). Surprisingly, such a need has been quite neglected in the area of temporal databases (TDBs). However, the telicatelic distinction has deep effects on TDB data and query semantics, and on conceptual modelling.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372433","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
A Domain-Specific Language for Normative Texts with Timing Constraints 具有时间约束的规范文本的领域特定语言
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.14
Runa Gulliksson, J. Camilleri
{"title":"A Domain-Specific Language for Normative Texts with Timing Constraints","authors":"Runa Gulliksson, J. Camilleri","doi":"10.1109/TIME.2016.14","DOIUrl":"https://doi.org/10.1109/TIME.2016.14","url":null,"abstract":"We are interested in the formal modelling and analysis of normative documents containing temporal restrictions. This paper presents a new language for this purpose, based on the deontic modalities of obligation, permission, and prohibition. It allows the specification of normative clauses over actions, which can be conditional on guards and timing constraints defined using absolute or relative discrete time. The language is compositional, where each feature is encoded as a separate operator. This allows for a straightforward operational semantics and a highly modular translation into timed automata. We demonstrate the use of the language by applying it to a case study and showing how this can be used for testing, simulation and verification of normative texts.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128664638","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
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning 时间线具有足够的表现力，能够捕捉到基于行动的时间计划
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.18
N. Gigante, A. Montanari, M. C. Mayer, Andrea Orlandini
{"title":"Timelines Are Expressive Enough to Capture Action-Based Temporal Planning","authors":"N. Gigante, A. Montanari, M. C. Mayer, Andrea Orlandini","doi":"10.1109/TIME.2016.18","DOIUrl":"https://doi.org/10.1109/TIME.2016.18","url":null,"abstract":"Planning prblems are usually expressed by specifying which actions can be performed to obtain a given goal. In temporal planning problems, actions come with a time duration and can overlap in time, which noticeably increase the complexity of the reasoning process. Action-based temporal planning has been thoroughly studied from the complexity-theoretic point of view, and it has been proved to be EXPSPACE-complete in its general formulation. Conversely, timeline-based planning problems are represented as a collection of variables whose time-varying behavior is governed by a set of temporal constraints, called synchronization rules. Timelines provide a unified framework to reason about planning and execution under uncertainty. Timeline-based systems are being successfully employed in real-world complex tasks, but, in contrast to action-based planning, little is known on their computational complexity and expressiveness. In particular, a comparison of the expressiveness of the action-and timeline-based formalisms is still missing. This paper contributes a first step in this direction by proving that timelines are expressive enough to capture action-based temporal planning, showing as a byproduct the EXPSPACE-completeness of timeline-based planning with no temporal horizon and bounded temporal relations only.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116718018","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}
引用次数: 24
On the Complexity of Fragments of Horn Modal Logics 角模态逻辑片段的复杂性
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.27
Davide Bresolin, Emilio Muñoz-Velasco, G. Sciavicco
{"title":"On the Complexity of Fragments of Horn Modal Logics","authors":"Davide Bresolin, Emilio Muñoz-Velasco, G. Sciavicco","doi":"10.1109/TIME.2016.27","DOIUrl":"https://doi.org/10.1109/TIME.2016.27","url":null,"abstract":"Modal logic is a paradigm for several useful and applicable formal systems in computer science, and, in particular, for temporal logics of various kinds. It generally retains the low complexity of classical propositional logic, but notable exceptions exist that present higher complexity or are even undecidable. In search of computationally well-behaved fragments, clausal forms and other sub-propositional restrictions of temporal and description logics have been recently studied. It is known that the Horn fragments of the modal logics between K and S4 are PSPACE-complete, keeping the same complexity of the the full propositional versions. In this paper, inspired by similar results in the temporal case, we sharpen the above result by showing that if we allow only box modalities in the language the Horn fragments of the modal logics between K and S4 become P-complete. Exploring the innermost reasons for the tractability of sub-Horn modal logics is a necessary condition to understand the behaviour of more expressive temporal and spatial languages under similar restrictions.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122430731","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
Combining Free Choice and Time in Petri Nets Petri网中自由选择与时间的结合
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.20
S. Akshay, L. Hélouët, R. Phawade
{"title":"Combining Free Choice and Time in Petri Nets","authors":"S. Akshay, L. Hélouët, R. Phawade","doi":"10.1109/TIME.2016.20","DOIUrl":"https://doi.org/10.1109/TIME.2016.20","url":null,"abstract":"Time Petri nets (TPNs) (Merlin 1974) are a classical extension of Petri nets with timing constraints attached to transitions, for which most verification problems are undecidable. We consider TPNs under a strong semantics with multiple enabling of transitions. We focus on a structural subclass of unbounded TPNs, where the underlying untimed net is free choice, and show that it enjoys nice properties under a multi-server semantics. In particular, we show that the questions of fireability (whether a chosen transition can fire), and termination (whether the net has a non-terminating run) are decidable for this class. We then consider the problem of robustness under guard enlargement (Puri et al. 2000), i.e., whether a given property is preserved even if the system is implemented on an architecture with imprecise time measurement. This question was studied for TPNs in (Akshay et al. 2016), and decidability of several problems was obtained for bounded classes of nets. We show that robustness of fireability is decidable for unbounded free choice TPNs with a multi-server semantics.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128212912","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
Automatic Verification, Performance Analysis, Synthesis and Optimization of Timed Systems 定时系统的自动验证、性能分析、综合与优化
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.31
K. Larsen
{"title":"Automatic Verification, Performance Analysis, Synthesis and Optimization of Timed Systems","authors":"K. Larsen","doi":"10.1109/TIME.2016.31","DOIUrl":"https://doi.org/10.1109/TIME.2016.31","url":null,"abstract":"Summary form only given. Timed automata and games, priced timed automata and energy automata have emerged as useful formalisms for modeling real-time and energy-aware systems as found in several embedded and cyber-physical systems. Within the last 20 years the various components of the UPPAAL tool-suite has been developed to support various types of analysis of these formalisms. This includes the classical usage of UPPAAL offering efficient model checking of hard real time constraints (formally expressed in the temporal logics TCTL and MITL) of timed automata models as well as the branch UPPAAL CORA supporting optimality analysis (expressed in weighted version of CTL) of priced timed automata. Most recently the branch UPPAAL SMC offers a highly scalable statistical model checking engine supporting performance analysis of stochastic timed automata with respect to MITL properties. The newest branch UPPAAL STRATEGO supports synthesis and evaluation of near-optimal yet safe strategies for stochastic timed games. This branch opens a new research direction where symbolic model checking techniques for real time systems are combined with machine learning.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115397028","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
Optimal Control for Simple Linear Hybrid Systems 简单线性混合系统的最优控制
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.9
Mahmoud A. A. Mousa, S. Schewe, D. Wojtczak
{"title":"Optimal Control for Simple Linear Hybrid Systems","authors":"Mahmoud A. A. Mousa, S. Schewe, D. Wojtczak","doi":"10.1109/TIME.2016.9","DOIUrl":"https://doi.org/10.1109/TIME.2016.9","url":null,"abstract":"This paper studies optimal time-bounded control in a simple subclass of linear hybrid systems, which consists of one continuous variable and global constraints. Each state has a continuous cost attached to it, which is linear in the sojourn time, while a discrete cost is attached to each transition taken. We show the corresponding decision problem to be NP-complete and develop an FPTAS for finding an approximate solution. We have implemented a small prototype to compare the performance of these approximate and precise algorithms for this problem. Our results indicate that the proposed approximation schemes scale. Furthermore, we show that the same problem with infinite time horizon is in LOGSPACE.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117345881","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
Consistent Query Answering for Atemporal Constraints over Temporal Databases 时态数据库非时态约束的一致性查询应答
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.23
J. Chomicki, J. Wijsen
{"title":"Consistent Query Answering for Atemporal Constraints over Temporal Databases","authors":"J. Chomicki, J. Wijsen","doi":"10.1109/TIME.2016.23","DOIUrl":"https://doi.org/10.1109/TIME.2016.23","url":null,"abstract":"Consistent query answering is a principled approach to query answering on inconsistent databases: when an inconsistent database has more than one plausible repair, queries are answered by returning the intersection of the query answers over all repairs. In this paper, we study consistent query answering over temporal databases relative to atemporal integrity constraints. A temporal database is conceptually viewed as a sequence of atemporal snapshot databases indexed by time. Two approaches to repairing are presented. In the first approach, each snapshot database is repaired individually and independently of earlier or later snapshots. This independence between snapshots facilitates the computation of consistent query answers. A second approach, which is seemingly more realistic, favors the persistence of attribute values in repairs.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587580","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
Stream Reasoning Using Temporal Logic and Predictive Probabilistic State Models 使用时间逻辑和预测概率状态模型的流推理
2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI: 10.1109/TIME.2016.28
Mattias Tiger, F. Heintz
{"title":"Stream Reasoning Using Temporal Logic and Predictive Probabilistic State Models","authors":"Mattias Tiger, F. Heintz","doi":"10.1109/TIME.2016.28","DOIUrl":"https://doi.org/10.1109/TIME.2016.28","url":null,"abstract":"Integrating logical and probabilistic reasoning and integrating reasoning over observations and predictions are two important challenges in AI. In this paper we propose P-MTL as an extension to Metric Temporal Logic supporting temporal logical reasoning over probabilistic and predicted states. The contributions are (1) reasoning over uncertain states at single time points, (2) reasoning over uncertain states between time points, (3) reasoning over uncertain predictions of future and past states and (4) a computational environment formalism that ground the uncertainty in observations of the physical world. Concrete robot soccer examples are given.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133506175","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信