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

2012 19th International Symposium on Temporal Representation and Reasoning最新文献

筛选
英文 中文
Reasoning about Plan Revision in Agent Programs 代理程序中计划修改的推理
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.23
N. Alechina
{"title":"Reasoning about Plan Revision in Agent Programs","authors":"N. Alechina","doi":"10.1109/TIME.2012.23","DOIUrl":"https://doi.org/10.1109/TIME.2012.23","url":null,"abstract":"This talk is on reasoning about agent programs written in Belief, Desire and Intention (BDI) agent programming languages. BDI programming languages (for example, [1], [2], [3]) have high-level programming primitives which correspond to the beliefs, goals and plans of an AI agent. A program contains a set of rules which allow the agent to adopt plans given its current beliefs and goals. Plans are essentially imperative programs. For example, an agent may have a rule which says that if it believes that it is currently located in room 1 and its goal is to be in room 2, then a suitable plan to adopt would be to exit room 1, turn right, move forward for 3 meters, turn right, and enter room 2.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125353827","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
Robustness Analysis for Scheduling Problems Using the Inverse Method 基于逆方法的调度问题鲁棒性分析
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.10
L. Fribourg, R. Soulat, D. Lesens, P. Moro
{"title":"Robustness Analysis for Scheduling Problems Using the Inverse Method","authors":"L. Fribourg, R. Soulat, D. Lesens, P. Moro","doi":"10.1109/TIME.2012.10","DOIUrl":"https://doi.org/10.1109/TIME.2012.10","url":null,"abstract":"Given a Parametric Timed Automaton (PTA) A and a reference valuation for timings, the Inverse Method (IM) synthesizes a constraint around the reference valuation where A behaves in the same time-abstract manner. This provides us with a quantitative measure of robustness of the behavior of A around the reference valuation. We show in this paper how IM can be applied in a specific way to treat the robustness of scheduling systems. We also explain how to use the method in order to synthesize large zones of the timing parameter space where the system is guaranteed to be schedulable. We illustrate the method on several examples of the literature as well as a case study originating from an industrial design project.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455834","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}
引用次数: 27
Temporal Implications of Database Information Accountability 数据库信息责任的时间含义
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.24
Kyriacos E. Pavlou, R. Snodgrass
{"title":"Temporal Implications of Database Information Accountability","authors":"Kyriacos E. Pavlou, R. Snodgrass","doi":"10.1109/TIME.2012.24","DOIUrl":"https://doi.org/10.1109/TIME.2012.24","url":null,"abstract":"Information restriction controls access and renders records immutable, information accountability requires data transparency to easily and efficiently determine when a particular use is appropriate. Information accountability in the context of relational databases is associated with time in a surprising number of ways, as is summarized in this paper. Notarization and validation of a database exploit the temporal semantics of a transaction-time database. A corruption can be associated with multiple times. Forensic analysis determines the when: bounds on the corruption time, and the where: also specified in terms of time. These bounds are depicted in a two-dimensional corruption diagram, with both axes denoting time. The various kinds of corruption events are defined in terms of time. A parameter termed the regret interval has significant security and performance implications. This paper emphasizes the deep connections between time and the definition, detection, forensic analysis, and characterized extent of a database corruption within the context of information accountability.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125204617","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
An Integrated First-Order Theory of Points and Intervals: Expressive Power in the Class of All Linear Orders 积分一阶点与区间理论:所有线性阶类的表达能力
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.11
Willem Conradie, Salih Durhan, G. Sciavicco
{"title":"An Integrated First-Order Theory of Points and Intervals: Expressive Power in the Class of All Linear Orders","authors":"Willem Conradie, Salih Durhan, G. Sciavicco","doi":"10.1109/TIME.2012.11","DOIUrl":"https://doi.org/10.1109/TIME.2012.11","url":null,"abstract":"There are two natural and well-studied approaches to temporal ontology and reasoning, that is, point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. Recently, a two-sorted point-interval temporal logic in a modal framework in which time instants (points) and time periods (intervals) are considered on a par has been presented. We consider here two-sorted first-order languages, interpreted in the class of all linear orders, based on the same principle, with relations between points, between intervals, and inter-sort. First, for those languages containing only interval-interval, and only inter-sort relations we give complete classifications of their sub-fragments in terms of relative expressive power, determining how many, and which, are the different two-sorted first-order languages with one or more such relations. Then, we consider the full two-sorted first-order logic with all the above mentioned relations, restricting ourselves to identify all expressively complete fragments and all maximal expressively incomplete fragments, and posing the basis for a forthcoming complete classification.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122686587","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
TVICS: An Efficient Traffic Video Information Converting System 一个高效的交通视频信息转换系统
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.9
Hang Yue, P. Revesz
{"title":"TVICS: An Efficient Traffic Video Information Converting System","authors":"Hang Yue, P. Revesz","doi":"10.1109/TIME.2012.9","DOIUrl":"https://doi.org/10.1109/TIME.2012.9","url":null,"abstract":"This paper presents a new system called TVICS that converts traffic video data into vehicular motion information in spatio-temporal databases. The TVICS system interpolates the vehicular trajectory data (time, location and velocity), which are extracted from video, and integrates them with spatial road information for the storage of dynamic transportation environments. TVICS can avoid the storage issues caused by traffic videos with their associated large data size. Moreover, users can manage and operate multiform and multidimensional traffic data in a spatio-temporal transportation environment. Experimental results show that TVICS has a high accuracy in transportation applications.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129136406","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
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction 守卫的口角:量化约束满足的可处理片段
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.19
Hubie Chen, Michal Wrona
{"title":"Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction","authors":"Hubie Chen, Michal Wrona","doi":"10.1109/TIME.2012.19","DOIUrl":"https://doi.org/10.1109/TIME.2012.19","url":null,"abstract":"The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132208689","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
A Review on Temporal Reasoning Using Support Vector Machines 基于支持向量机的时间推理研究进展
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.15
R. Madeo, C. Lima, S. M. Peres
{"title":"A Review on Temporal Reasoning Using Support Vector Machines","authors":"R. Madeo, C. Lima, S. M. Peres","doi":"10.1109/TIME.2012.15","DOIUrl":"https://doi.org/10.1109/TIME.2012.15","url":null,"abstract":"Recently, Support Vector Machines have presented promissing results to various machine learning tasks, such as classification and regression. These good results have motivated its application to several complex problems, including temporal information analysis. In this context, some studies attempt to extract temporal features from data and submit these features in a vector representation to traditional Support Vector Machines. However, Support Vector Machines and its traditional variations do not consider temporal dependency among data. Thus, some approaches adapt Support Vector Machines internal mechanism in order to integrate some processing of temporal characteristics, attempting to make them able to interpret the temporal information inherent on data. This paper presents a review on studies covering this last approach for dealing with temporal information: incorporating temporal reasoning into Support Vector Machines and its variations.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"62 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114041185","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
Merging Temporal Annotations 合并时态注释
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.14
H. Llorens, N. UzZaman, James F. Allen
{"title":"Merging Temporal Annotations","authors":"H. Llorens, N. UzZaman, James F. Allen","doi":"10.1109/TIME.2012.14","DOIUrl":"https://doi.org/10.1109/TIME.2012.14","url":null,"abstract":"In corpus linguistics obtaining high-quality semantically-annotated corpora is a fundamental goal. Various annotations of the same text can be obtained from automated systems, human annotators, or a combination of both. Obtaining, by manual means, a merged annotation from these, which improves the correctness of each individual annotation, is costly. We present automatic algorithms specifically for merging temporal annotations. These have been evaluated merging the annotations of three state-of-the-art systems on the gold standard corpora and the correctness of the merged annotation improved over that of individual annotations and baseline merging algorithms.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116744491","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
A Tableau for the Combination of CTL and BCTL CTL与BCTL的结合
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.17
J. McCabe-Dansted
{"title":"A Tableau for the Combination of CTL and BCTL","authors":"J. McCabe-Dansted","doi":"10.1109/TIME.2012.17","DOIUrl":"https://doi.org/10.1109/TIME.2012.17","url":null,"abstract":"It is known that there is an exponential decision procedure for CTL. Given that important properties cannot be expressed in CTL, we seek a pure tableau based decision procedure (that does not rely on translations into automata) that is exponential for formulas that have only a bounded number of non-CTL properties. In this paper we present such a tableau for a combination of CTL and a bundled variant(BCTL*) of CTL* that is singly exponential for formulae with abounded number of path-sub formulae. The existing pure tableau for CTL* was built upon the pure tableau for BCTL*, so this paper is also a natural first step towards a pure tableau technique for CTL* that is singly exponential when similarly restricted.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867464","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 Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals 实数上时间邻域逻辑的最优表系统
2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI: 10.1109/TIME.2012.18
A. Montanari, P. Sala
{"title":"An Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals","authors":"A. Montanari, P. Sala","doi":"10.1109/TIME.2012.18","DOIUrl":"https://doi.org/10.1109/TIME.2012.18","url":null,"abstract":"The propositional logic of temporal neighborhood (PNL) features two modalities that make it possible to access intervals adjacent to the right and to the left of the current one. PNL has been extensively studied in the last years. In particular, decidability and complexity of its satisfiability problem have been systematically investigated, and optimal decision procedures have been developed, for various (classes of) linear orders, including N, Z, and Q. The only missing piece is that for R. It is possible to show that PNL is expressive enough to separate Q and R. Unfortunately, there is no way to reduce the satisfiability problem for PNL over R to that over Q. In this paper, we first prove the NEXPTIME-completeness of the satisfiability problem for PNL over R, and then we devise an optimal tableau system for it.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128531851","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
下一页 尾页
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学术官方微信