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

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

筛选
英文 中文
Efficient Bit-Level Model Reductions for Automated Hardware Verification 自动硬件验证的有效位级模型缩减
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.11
S. Tverdyshev, Eyad Alkassar
{"title":"Efficient Bit-Level Model Reductions for Automated Hardware Verification","authors":"S. Tverdyshev, Eyad Alkassar","doi":"10.1109/TIME.2008.11","DOIUrl":"https://doi.org/10.1109/TIME.2008.11","url":null,"abstract":"Transition systems which do not perform domain-specific operations on their state variables can be efficiently reduced. We present two different algorithms which automatically eliminate domain-specific operations and reduce the domains of occurring variables from infinite to small domains. Our work extends earlier techniques which are applicable solely to combinatorial properties to temporal properties of transition systems. We have implemented our algorithm as a proof method in the Isabelle/HOL theorem prover and applied it to bit-level hardware designs. To demonstrate the efficiency of our technique, we fully automatically verify a liveness property of a pipelined processor and correctness of a memory management unit.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"11 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":"132252300","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}
引用次数: 12
Regarding Overlapping as a Basic Concept of Subset Spaces 将重叠作为子集空间的基本概念
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.18
B. Heinemann
{"title":"Regarding Overlapping as a Basic Concept of Subset Spaces","authors":"B. Heinemann","doi":"10.1109/TIME.2008.18","DOIUrl":"https://doi.org/10.1109/TIME.2008.18","url":null,"abstract":"An operator describing overlapping is substituted/or the effort modality of Moss and Parikh's logic of knowledge and topology. This means that the spatial idea underlying that system, viz closeness, is replaced with covering. We ask what properties of frames can be expressed by means of the new language. It turns out that the language is, for example, capable of characterizing directed spaces. After adding some expressive power originating from hybrid logic we are able to deal with linearity as well. This makes a temporal interpretaion of the new system possible. - The main issues of this paper are first corresponding completeness theorems, and second the decidability of the arising logics.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"8 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":"128844128","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
Using Oracle Extensibility Framework for Supporting Temporal and Spatio-Temporal Applications 使用Oracle可扩展性框架支持时间和时空应用程序
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.29
K. Kanth, Robert Hanckel, Aravind Yalamanchi
{"title":"Using Oracle Extensibility Framework for Supporting Temporal and Spatio-Temporal Applications","authors":"K. Kanth, Robert Hanckel, Aravind Yalamanchi","doi":"10.1109/TIME.2008.29","DOIUrl":"https://doi.org/10.1109/TIME.2008.29","url":null,"abstract":"Databases such as Oracle, IBM, SQLServer are increasing their support for temporal and spatio- temporal data with every release. In this paper, we describe how Oracle users can extend the existing functionality in Oracle and ground their research by using Oracle's extensibility. To illustrate its applicability to temporal data, we present how a Map21 (M.A. Nascimento and M.H. Dunham, 1999) based index can be implemented using this framework.. Oracle uses the same extensibility framework to implement R-trees and rules manager. We describe enhancements to Oracle' R-trees for spatio-temporal data, and real-time event processing using Oracle's rules manager.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"85 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":"121776949","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
An optimal tableau for Right Propositional Neighborhood Logic over Trees 树上右命题邻域逻辑的最优表
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.17
Davide Bresolin, A. Montanari, P. Sala
{"title":"An optimal tableau for Right Propositional Neighborhood Logic over Trees","authors":"Davide Bresolin, A. Montanari, P. Sala","doi":"10.1109/TIME.2008.17","DOIUrl":"https://doi.org/10.1109/TIME.2008.17","url":null,"abstract":"Propositional interval temporal logics come into play in many areas of artificial intelligence and computer science. Unfortunately, most of them turned out to be (highly) undecidable. Some positive exceptions, belonging to the classes of neighborhood logics and of logics of subinterval relations, have been recently identified. In this paper, we address the decision problem for the future fragment of Propositional Neighborhood Logic (Right Propositional Neighborhood Logic) interpreted over trees and we positively solve it by providing a tableau-based decision procedure that works in exponential space. Moreover, we prove that the decision problem for the logic is EXPSPACE-hard, thus showing the optimality of the proposed procedure.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"36 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":"123180357","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
A Heuristic Approach to Order Events in Narrative Texts 叙事文本中事件排序的启发式方法
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.13
Farid Nouioua
{"title":"A Heuristic Approach to Order Events in Narrative Texts","authors":"Farid Nouioua","doi":"10.1109/TIME.2008.13","DOIUrl":"https://doi.org/10.1109/TIME.2008.13","url":null,"abstract":"We describe a heuristic method to order the events evoked in texts describing road accidents. The method consists first in generating, by non monotonic inference rules, a set of precedence and simultaneity constraints between temporal references linked to particular words of the text. Then, the proposed algorithm updates the narration order of the events to satisfy these constraints and give the real order of the events described in this text. The temporal information is represented according to a linear temporal model which is enhanced in a first order reified language.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"5 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":"122147336","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
Real-Time Model Checking: Algorithms and Complexity 实时模型检查:算法和复杂性
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.30
J. Worrell
{"title":"Real-Time Model Checking: Algorithms and Complexity","authors":"J. Worrell","doi":"10.1109/TIME.2008.30","DOIUrl":"https://doi.org/10.1109/TIME.2008.30","url":null,"abstract":"In this talk we describe a new automata-theoretic approach to model checking real-time systems. We show how this approach yields both upper and lower complexity bounds for various decision problems involving timed automata and temporal logics. To put these developments in context we survey some classical results concerning automata, temporal logic and monadic predicate logic over the reals.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"35 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":"127140975","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
Topology-based Variable Ordering Strategy for Solving Disjunctive Temporal Problems 解离时态问题的基于拓扑的变量排序策略
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.23
Yuechang Liu, Yunfei Jiang, Hong Qian
{"title":"Topology-based Variable Ordering Strategy for Solving Disjunctive Temporal Problems","authors":"Yuechang Liu, Yunfei Jiang, Hong Qian","doi":"10.1109/TIME.2008.23","DOIUrl":"https://doi.org/10.1109/TIME.2008.23","url":null,"abstract":"Many temporal problems arising in automated planning and scheduling can be expressed as disjunctive temporal problems (DTPs). Most of DTP solvers in the literature treat DTPs as constraint satisfaction problems (CSPs) or satisfiability problems (SATs), and solve them using standard CSP (SAT) techniques. Basically DTPs are represented through logically related topological relations between temporal variables, however, unfortunately little work has been done on exploiting the topological information to direct the search for DTP resolving. According to the \"fail-first \"(FF) principle for dynamic variable ordering (DVO) heuristics in CSP literature, this paper proposes a DVO which is based on the topological structure of DTP (which is defined to be Disjunctive Temporal Network). Experimental results reveal that the proposed DVO outperforms Minimal Remaining Values heuristics-a DVO that is widely used in existing DTP solvers, especially for the hard and large-scale problems. And, a CSP based procedure with the best of the heuristics wins TSAT++ on most of the test problems.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"17 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":"121171674","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
Satisfying a Fragment of XQuery by Branching-Time Reduction 用分支时间缩减法满足XQuery的片段
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.20
Sylvain Hallé, Roger Villemaire
{"title":"Satisfying a Fragment of XQuery by Branching-Time Reduction","authors":"Sylvain Hallé, Roger Villemaire","doi":"10.1109/TIME.2008.20","DOIUrl":"https://doi.org/10.1109/TIME.2008.20","url":null,"abstract":"Configuration logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study CL satisfiability and seek a deterministic decision procedure to build models of satisfiable CL formula. To this end, we show how to revert CL satisfiability into an equivalent CTL satisfiability problem in order to leverage existing model construction algorithms for CTL formulae.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"75 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":"115404832","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
Practical First-Order Temporal Reasoning 实用一阶时间推理
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.15
C. Dixon, Michael Fisher, B. Konev, A. Lisitsa
{"title":"Practical First-Order Temporal Reasoning","authors":"C. Dixon, Michael Fisher, B. Konev, A. Lisitsa","doi":"10.1109/TIME.2008.15","DOIUrl":"https://doi.org/10.1109/TIME.2008.15","url":null,"abstract":"In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"39 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":"114855996","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
Good Friends are Hard to Find! 好朋友难寻!
2008 15th International Symposium on Temporal Representation and Reasoning Pub Date : 2008-06-16 DOI: 10.1109/TIME.2008.10
Thomas Brihaye, N. Markey, Mohamed Ghannem, Lionel Rieg
{"title":"Good Friends are Hard to Find!","authors":"Thomas Brihaye, N. Markey, Mohamed Ghannem, Lionel Rieg","doi":"10.1109/TIME.2008.10","DOIUrl":"https://doi.org/10.1109/TIME.2008.10","url":null,"abstract":"We focus on the problem of finding (the size of) a minimal winning coalition in a multi-player game. We prove that deciding whether there is a winning coalition of size at most k is HP-complete, while deciding whether k is the optimal size is DP -complete. We also study different variants of our original problem: the function problem, where the aim is to effectively compute the coalition; more succinct encoding of the game; and richer families of winning objectives.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"69 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":"127265334","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
下一页 尾页
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学术官方微信