By Topic

Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06)

Date 15-17 June 2006

Filter Results

Displaying Results 1 - 25 of 34
  • Thirteenth International Symposium on Temporal Representation and Reasoning - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (243 KB)
    Freely Available from IEEE
  • Thirteenth International Symposium on Temporal Representation and Reasoning - Title Page

    Publication Year: 2006, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Thirteenth International Symposium on Temporal Representation and Reasoning - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • Thirteenth International Symposium on Temporal Representation and Reasoning - Table of contents

    Publication Year: 2006, Page(s):v - vi
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Message from the Program Committee Co-Chairs

    Publication Year: 2006, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (29 KB) | HTML iconHTML
    Freely Available from IEEE
  • Symposium Organization

    Publication Year: 2006, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Representing trends and trend dependencies with multiple granularities

    Publication Year: 2006, Page(s):3 - 10
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    In this paper we propose a formal framework allowing the expression of temporal trends which involve multiple granularities. We first discuss the representation of trend dependencies and then we propose a characterization of trends according to different temporal features considering also the relationships with the specific temporal granularities involved in the trend definition. A suitable tempor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is There a Future for Deductive Temporal Verification?

    Publication Year: 2006, Page(s):11 - 18
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    In this paper, we consider a tractable sub-class of propositional linear time temporal logic, and provide a complete clausal resolution calculus for it. The fragment is important as it can be used to represent simple Buchi automata. We also show that, just as the emptiness check for a Buchi automaton is tractable, the complexity of deciding unsatisfiability, via resolution, of our logic is polynom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Verification of Continuous Time Systems by Discrete Temporal Induction

    Publication Year: 2006, Page(s):19 - 26
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    We present a temporal framework suitable for the specification and verification of safety properties of real time hybrid systems. We show that, given suitable assumptions (like non-Zenoness and left continuity) continuous time can be discretized by introducing a next operator that is similar to the one usually found in discrete time temporal logics and can be safely and effectively used in specifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CTL Model Checking for Labelled Tree Queries

    Publication Year: 2006, Page(s):27 - 35
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    Querying and efficiently validating properties on labelled tree structures has become an important part of research in numerous domains. In this paper, we show how a fragment of XPath called configuration logic (CL) can be embedded into computation tree logic. This framework embeds into CTL a larger subset of XPath than previous work and in particular allows universally and existentially quantifie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decidable Temporal Logic for Events and States

    Publication Year: 2006, Page(s):36 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    This paper introduces a new interval temporal logic, TPL*. Existing interval temporal logics, we claim, are inadequate to represent the meanings of certain natural language constructions, despite exhibiting high computational complexity. TPL* overcomes these problems, presents the semantics of some natural language constructions, and captures important real-time problems like behaviour of complex ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In time alone: on the computational power of querying the history

    Publication Year: 2006, Page(s):42 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic data interchange. In this paper we study the computational power of referring to the past primitive. To do that we propose a refined formal model, history dependent machine (RDM), which uses querying the history as its sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Temporal Logic for Spatial Reasoning: Spatial Propositional Neighborhood Logic

    Publication Year: 2006, Page(s):50 - 60
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    It is widely accepted that spatial reasoning plays a central role in artificial intelligence, for it has a wide variety of potential applications, e.g., in robotics, geographical information systems, medical analysis and diagnosis. As noticed by many authors, spatial and temporal reasoning have a close connection. In this paper we propose a new, semi-decidable, modal logic for spatial reasoning th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task Scheduling for a TemporalWorkflow Management System

    Publication Year: 2006, Page(s):61 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    A workflow management system (WfMS) supports the coordinated execution of simple activities (tasks), assigning them to human or automatic executors (agents), to achieve the goal defined for a business process. The workflow scheduler performs task assignment policies: temporal aspects, such as availability time and skills of agents, deadlines for task completion, constraints over timestamps for tas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ultimately Periodic Simple Temporal Problems (UPSTPs)

    Publication Year: 2006, Page(s):69 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are an extension of STPs (simple temporal problems). We study some properties of these new types of constraint networks. We also propose a constraint propagation algorithm. We show that this algorithm decides the consistency... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generic Toolkit for n-ary Qualitative Temporal and Spatial Calculi

    Publication Year: 2006, Page(s):78 - 86
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    Temporal and spatial reasoning is a central task for numerous applications in many areas of artificial intelligence. For this task, numerous formalisms using the qualitative approach have been proposed. Clearly, these formalisms share a common algebraic structure. In this paper we propose and study a general definition of such formalisms by considering calculi based on basic relations of an arbitr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automaton-based approach to the verification of timed workflow schemas

    Publication Year: 2006, Page(s):87 - 94
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    Nowadays, the ability of providing an automated support to the management of business processes is commonly recognized as a main competitive factor for companies. One of the most critical resources to deal with is time, but, unfortunately, the time management support offered by most workflow systems is rather limited. In this paper we focus our attention on the modeling and verification of workflo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional and Composite Temporal Constraints with Preferences

    Publication Year: 2006, Page(s):95 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    Preferences in temporal problems are common but significant in many real world applications. In this paper, we extend our temporal reasoning framework, managing numeric and symbolic information, in order to handle preferences. Unlike the existing models managing single temporal preferences, ours supports four types of preferences, namely: numeric and symbolic temporal preferences, composite prefer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring, monitoring and controlling software maintenance efforts

    Publication Year: 2006, Page(s):103 - 110
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    Launching a new software product on the market and maximizing the profit obtained from it is already an art considering the high expectations and conflicting requirements of the software market. Product managers have to take tough decisions regarding the product life cycle like choosing the right moment for a new release, modernization or system replacement. Under these conditions they have to con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Heuristics for Solving Probabilistic Interval Algebra Networks

    Publication Year: 2006, Page(s):111 - 120
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (481 KB) | HTML iconHTML

    A probabilistic interval algebra (PIA) network is an interval algebra network with probabilities associated with the labels on an edge. The probabilities on each edge sum to 1. A solution is a consistent scenario where the product of the probabilities associated with each unique edge label is maximized. In this paper we investigate previous PIA network solution algorithms, and propose new ones. Ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How Would You Like to Aggregate Your Temporal Data?

    Publication Year: 2006, Page(s):121 - 136
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    Real-world data management applications generally manage temporal data, i.e., they manage multiple states of time-varying data. Many contributions have been made by the research community for how to better model, store, and query temporal data. In particular, several dozen temporal data models and query languages have been proposed. Motivated in part by the emergence of non-traditional data manage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregation Estimation for 2D Moving Points

    Publication Year: 2006, Page(s):137 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    The new max-count aggregation operator presented finds the maximum number of 2D moving points that overlap a moving query rectangle within a specified time interval. Two linearly moving points define the query rectangle which may move, and grow or shrink over time. We give the first constant running-time estimation algorithm to solve the max-count aggregation problem in two dimensions. The estimat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Interpolation Algorithms for Temporal-Oriented Datasets

    Publication Year: 2006, Page(s):145 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    Spatiotemporal datasets can be classified into two categories: temporal-oriented and spatial-oriented datasets depending on whether missing spatiotemporal values are closer to the values of its temporal or spatial neighbors. We present an adaptive spatiotemporal interpolation model that can estimate the missing values in both categories of spatiotemporal datasets. The key parameters of the adaptiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting Uncertain Temporal Relations from Mined Frequent Sequences

    Publication Year: 2006, Page(s):152 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    In this work we address an approach for solving the problem of building a temporal constraint network from the set of frequent sequences obtained after a temporal data mining process. In particular, the temporal data mining algorithm used is TSET (Guil et al., 2004), an algorithm based on the inter-transactional framework that uses a unique tree-based structure to discover frequent sequences from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Verification of an Optimistic Concurrency Control Algorithm using SPIN

    Publication Year: 2006, Page(s):160 - 167
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    To contribute to the promotion of concurrency controllers for temporal databases, we propose in this paper to formally check the access concurrency control algorithm proposed using SPIN. This algorithm is based on the optimistic approach and must guarantee strong consistency for transaction time relations. SPIN provides a software model checking with a powerful tool to detect errors. It is an appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.