Time最新文献

{"title":"Extracting Interval Temporal Logic Rules: A First Approach","authors":"Davide Bresolin, Enrico Cominato, Simone Gnani, Emilio Muñoz-Velasco, G. Sciavicco","doi":"10.4230/LIPIcs.TIME.2018.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.7","url":null,"abstract":"Discovering association rules is a classical data mining task with a wide range of applications that include the medical, the financial","PeriodicalId":75226,"journal":{"name":"Time","volume":"24 1","pages":"7:1-7:15"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86143147","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}

{"title":"Computational Complexity of a Core Fragment of Halpern-Shoham Logic","authors":"P. Walega","doi":"10.4230/LIPIcs.TIME.2018.23","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.23","url":null,"abstract":"Halpern-Shoham logic (HS) is a highly expressive interval temporal logic but the satisfiability problem of its formulas is undecidable. The main goal in the research area is to introduce fragments of the logic which are of low computational complexity and of expressive power high enough for practical applications. Recently introduced syntactical restrictions imposed on formulas and semantical constraints put on models gave rise to tractable HS fragments for which prototypical real-world applications have already been proposed. One of such fragments is obtained by forbidding diamond modal operators and limiting formulas to the core form, i.e., the Horn form with at most one literal in the antecedent. The fragment was known to be NL-hard and in P but no tight results were known. In the paper we prove its P-completeness in the case where punctual intervals are allowed and the timeline is dense. Importantly, the fragment is not referential, i.e., it does not allow us to express nominals (which label intervals) and satisfaction operators (which enables us to refer to intervals by their labels). We show that by adding nominals and satisfaction operators to the fragment we reach NPcompleteness whenever the timeline is dense or the interpretation of modal operators is weakened (excluding the case when punctual intervals are disallowed and the timeline is discrete). Moreover, we prove that in the case of language containing nominals but not satisfaction operators, the fragment is still NP-complete over dense timelines. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics","PeriodicalId":75226,"journal":{"name":"Time","volume":"5 1","pages":"23:1-23:18"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85401474","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}

{"title":"Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking","authors":"Luke Hunsberger, Roberto Posenato","doi":"10.4230/LIPIcs.TIME.2018.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.15","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"56 1","pages":"15:1-15:15"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78298871","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}

{"title":"Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty","authors":"Combi Carlo, Roberto Posenato","doi":"10.4230/LIPIcs.TIME.2018.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.9","url":null,"abstract":"The proper handling of temporal constraints is crucial in many domains. As a particular challenge, temporal constraints must be also handled when different specific situations happen (conditional constraints) and when some event occurrences can be only observed at run time (contingent constraints). In this paper we introduce Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty (CSTNPSUs), in which contingent constraints are made more flexible (guarded constraints) and they are also specified as conditional constraints. It turns out that guarded constraints require the ability to reason on both kinds of constraints in a seamless way. In particular, we discuss CSTNPSU features through a motivating example and, then, we introduce the concept of controllability for such networks and the related sound checking algorithm. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning, Computing methodologies → Planning under uncertainty, Computing methodologies → Planning for deterministic actions","PeriodicalId":75226,"journal":{"name":"Time","volume":"90 1","pages":"9:1-9:16"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74762161","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}

{"title":"Algebraic Operators for Processing Sets of Temporal Intervals in Relational Databases","authors":"Andreas Dohr, C. Engels, Andreas Behrend","doi":"10.4230/LIPIcs.TIME.2018.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.11","url":null,"abstract":"The efficient management of temporal data has become increasingly important for many database applications. Most commercial systems already allow the management of temporal data but the operational support for processing this data is still rather limited. One particular reason is that many extension proposals typically require considerable modifications of the underlying database engine. In this paper, we propose a lightweight solution where temporal operators are realized using a library of user-defined functions. This way the complexity of temporal queries can be drastically reduced leading to more readable and less error-prone code without touching the database system. Our experiments show that the proposed operators significantly outperform temporal queries formulated in pure SQL. In addition, we investigate the possibility to incorporate algebraic optimization strategies directly into our operator definitions which allow for further performance improvements. 2012 ACM Subject Classification Information systems → Database management system engines, Information systems → Information systems applications","PeriodicalId":75226,"journal":{"name":"Time","volume":"26 1","pages":"11:1-11:16"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90215541","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}

{"title":"Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach","authors":"A. Bolotov, Montserrat Hermo, P. Lucio","doi":"10.4230/LIPIcs.TIME.2018.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.5","url":null,"abstract":"Temporal logic has become essential for various areas in computer science, most notably for the specification and verification of hardware and software systems. For the specification purposes rich temporal languages are required that, in particular, can express fairness constraints. For linear-time logics which deal with fairness in the linear-time setting, one-pass and two-pass tableau methods have been developed. In the repository of the CTL-type branching-time setting, the well-known logics ECTL and ECTL^+ were developed to explicitly deal with fairness. However, due to the syntactical restrictions, these logics can only express restricted versions of fairness. The logic CTL^*, often considered as \"the full branching-time logic\" overcomes these restrictions on expressing fairness. However, this logic itself, is extremely challenging for the application of verification techniques, and the tableau technique, in particular. For example, there is no one-pass tableau construction for this logic, while it is known that one-pass tableau has an additional benefit enabling the formulation of dual sequent calculi that are often treated as more \"natural\" being more friendly for human understanding. Based on these two considerations, the following problem arises - are there logics that have richer expressiveness than ECTL^+ yet \"simpler\" than CTL^* for which a one-pass tableau can be developed? In this paper we give a solution to this problem. We present a tree-style one-pass tableau for a sub-logic of CTL^* that we call ECTL^#, which is more expressive than ECTL^+ allowing the formulation of a new range of fairness constraints with \"until\" operator. The presentation of the tableau construction is accompanied by an algorithm for constructing a systematic tableau, for any given input of admissible branching-time formulae. We prove the termination, soundness and completeness of the method. As tree-shaped one-pass tableaux are well suited for the automation and are amenable for the implementation and for the formulation of sequent calculi, our results also open a prospect of relevant developments of the automation and implementation of the tableau method for ECTL^#, and of a dual sequent calculi.","PeriodicalId":75226,"journal":{"name":"Time","volume":"15 1","pages":"5:1-5:22"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75507085","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}

{"title":"Bodies as Evidence","authors":"A. M’charek","doi":"10.1215/9781478004301","DOIUrl":"https://doi.org/10.1215/9781478004301","url":null,"abstract":"The constitution of a national security state transformed the United States into a new kind of secret society after World War II, one in which state power rests to an unprecedented degree precisely on the ability of officials to manage the public-secret divide through the mobilization of threat. This secrecy/ threat matrix marks all state secrets as equivalents of the atomic secret, making revelation a matter not just of politics but of the life or death of the nation-state. The Cold War arms race — founded on the minute- to-minute possibility of nuclear war — installed the secrecy/threat matrix as a conceptual infrastructure, enabling a new species of politics in the United States. Instead of enabling a system in which knowledge is power, the national security state’s system of compartmentalized secrecy produces a world in which knowledge is increasingly rendered suspect. This is a profound shift in how secrecy functions socially. In such a nation-state, secrecy becomes an increasingly pathological administrative form, one that prevents confidence in knowledge","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66039681","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}

{"title":"Results on Alternating-Time Temporal Logics with Linear Past","authors":"L. Bozzelli, A. Murano, L. Sorrentino","doi":"10.4230/LIPIcs.TIME.2018.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2018.6","url":null,"abstract":"We investigate the succinctness gap between two known equally-expressive and different linearpast extensions of standard CTL∗ (resp., ATL∗). We establish by formal non-trivial arguments that the ‘memoryful’ linear-past extension (the history leading to the current state is taken into account) can be exponentially more succinct than the standard ‘local’ linear-past extension (the history leading to the current state is forgotten). As a second contribution, we consider the ATL-like fragment, denoted ATLlp, of the known ‘memoryful’ linear-past extension of ATL∗. We show that ATLlp is strictly more expressive than ATL, and interestingly, it can be exponentially more succinct than the more expressive logic ATL∗. Moreover, we prove that both satisfiability and model-checking for the logic ATLlp are Exptime-complete. Digital Object Identifier 10.4230/LIPIcs...","PeriodicalId":75226,"journal":{"name":"Time","volume":"47 1","pages":"6:1-6:22"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79340771","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}

{"title":"Constraint Identification Using Modified Hoare Logic on Hybrid Models of Gene Networks","authors":"Jonathan Behaegel, J. Comet, M. Folschette","doi":"10.4230/LIPIcs.TIME.2017.5","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2017.5","url":null,"abstract":"We present a new hybrid Hoare logic dedicated for a class of linear hybrid automata well suited to model gene regulatory networks. These automata rely on Thomas' discrete framework in which qualitative parameters have been replaced by continuous parameters called celerities. The identification of these parameters remains one of the keypoints of the modelling process, and is difficult especially because the modelling framework is based on a continuous time. We introduce Hoare triples which handle biological traces and pre/post-conditions. Observed chronometrical biological traces play the role of an imperative program for classical Hoare logic and our hybrid Hoare logic, defined by inference rules, is proved to be sound. Furthermore, we present a weakest precondition calculus (a la Dijkstra) which leads to constraints on dynamical parameters. Finally, we illustrate our \" constraints generator \" with a simplified circadian clock model describing the rhythmicity of cells in mammals on a 24-hour period.","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"5:1-5:21"},"PeriodicalIF":0.0,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46487775","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}

{"title":"Models and Algorithms for Chronology","authors":"G. Geeraerts, Eythan Levy, F. Pluquet","doi":"10.4230/LIPIcs.TIME.2017.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2017.13","url":null,"abstract":"The last decades have seen the rise of many fundamental chronological debates in Old World archaeology, with far-reaching historical implications. Yet, outside of radiocarbon dating—where Bayesian formal tools and models are applied—these chronological debates are still relying on non-formal models, and dates are mostly derived by hand, without the use of mathematical or computational tools, albeit the large number of complex constraints to be taken into account. This article presents formal models and algorithms for encoding archaeologically-relevant chronological constraints, computing optimal chronologies in an automated way, and automatically checking for chronological properties of a given model. These techniques are partly inspired from those (namely zones and DBMs) that have been developed in the setting of automated analysis of timed automata. Digital Object Identifier 10.4230/LIPIcs...","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"13:1-13:18"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48242248","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}