Scheduled System Maintenance
On Tuesday, September 25, IEEE Xplore will undergo scheduled maintenance from 1:00–5:00 pm ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Temporal Representation and Reasoning, 14th International Symposium on

28-30 June 2007

Filter Results

Displaying Results 1 - 25 of 33
  • 14th International Symposium on Temporal Representation and Reasoning - Cover

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

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

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • 14th International Symposium on Temporal Representation and Reasoning - TOC

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

    Publication Year: 2007, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (30 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2007, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • TIME Symposium Steering Committee

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • External referees

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Automated Planning in Temporal Domains: Some Recent Advances and Current Research Topics

    Publication Year: 2007, Page(s):3 - 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (90 KB) | HTML iconHTML

    Automated planning is a central area of artificial intelligence, involving the design of languages and computational models for reasoning about actions, change and time. In domain-independent planning, a planning problem is specified by the description of an initial world state, a set of desired goals to achieve and a set of possible actions or action schemata (domain operators). A solution of a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Branching Time Logics

    Publication Year: 2007, Page(s): 5
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (122 KB) | HTML iconHTML

    Branching-time logics are temporal logics that allow quantification over possible futures. Such logics have been considered very early by the automated verification community because efficient model-checking algorithms for logics like CTL could be easily implemented and were used successfully. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Science of Temporal Databases

    Publication Year: 2007, Page(s):6 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (107 KB) | HTML iconHTML

    Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathematical and engineering work, the scientific perspective has been much less prominent. This keynote elaborate the scientific perspective, apply it to research questions in temporal databases, and emphasize that this new way of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporalising Tractable Description Logics

    Publication Year: 2007, Page(s):11 - 22
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    It is known that for temporal languages, such as first-order LTL, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal description logics as well: constant binary relations together with general concept subsumptions in combinations of LTL and the basic description logic ALC cause undecidability. In this paper, we explore temporal extensions o... View full abstract»

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

    Publication Year: 2007, Page(s):23 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    The paper introduces and investigates relational temporal machine (RTM) as a general abstract model for generic temporal querying. The RTM devices subsume most temporal query languages that have emerged in the literature. A first contribution of the paper is to provide two simplified forms for our machines, namely extended one- tape RTMS and one-tape RTMS. Another contribution is to establish conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language

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

    A temporal database can be represented as a finite sequence of relational instances. Queries over such temporal instances usually map the input sequences to relation instances. Motivated by emerging applications, we are investigating a new type of queries over temporal instances, called t2t queries (temporal-to-temporal queries). The issue is to develop languages able to define mappings from tempo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Natural Deduction for Propositional Linear-Time Temporal Logic

    Publication Year: 2007, Page(s):47 - 58
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (198 KB) | HTML iconHTML

    We present a proof searching technique for the natural deduction calculus for the prepositional linear-time temporal logic and prove its correctness. This opens the prospect to apply our technique as an automated reasoning tool in a number of emerging computer science applications and in a deliberative decision making framework across various AI applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing a Temporal Relation Tagged Corpus of Chinese Based on Dependency Structure Analysis

    Publication Year: 2007, Page(s):59 - 69
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    This paper describes an annotation guideline for a temporal relation tagged corpus. Our goal is to construct a machine learnable model that automatically analyzes temporal events and relations between events. Since analyzing all combinations of events is inefficient, we examine use of dependency structure analysis to efficiently recognize meaningful temporal relations. We survey a small tagged dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conceptual Modeling of Temporal Clinical Workflows

    Publication Year: 2007, Page(s):70 - 81
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    The diffusion of clinical guidelines to describe the proper way to deal with patients' situations is spreading out and opens new issues in the context of modeling and managing (temporal) information about medical activities. Guidelines can be seen as processes describing the sequence of activities to be executed, and thus approaches proposed in the business context can be used to model them. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Equivalence of Automaton-Based Representations of Time Granularities

    Publication Year: 2007, Page(s):82 - 93
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    A time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit. In this paper we explore an automaton-based approach to the management of time granularity that compactly represents time granularities as single-string automata with counters, that is, Buchi automata, extended with counters, that accept a single in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effects of Bounding Syntactic Resources on Presburger LTL

    Publication Year: 2007, Page(s):94 - 104
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    We study decidability and complexity issues for fragments of LTL with Presburger constraints by restricting the syntactic resources of the formulae (the class of constraints, the number of variables and the distance between two states for which counters can be compared) while preserving the strength of the logical operators. We provide a complete picture refining known results from the literature,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended Time Constraints for Sequence Mining

    Publication Year: 2007, Page(s):105 - 116
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8001 KB) | HTML iconHTML

    Many applications require techniques for temporal knowledge discovery. Some of those approaches can handle time constraints between events. In particular some work has been done to mine generalized sequential patterns. However, such constraints are often too crisp or need a very precise assessment to avoid erroneous information. Therefore, in this paper we propose to soften temporal constraints us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Analysis of Temporal Relations within a Discourse

    Publication Year: 2007, Page(s):117 - 128
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (146 KB) | HTML iconHTML

    In this paper we present a rule-based system of automatic analysis of temporal relations within a discourse for Czech. The core algorithm of the system is the so-called "recursive temporal property" (RTP) of Czech that predicts relative ordering relations between finite verbs in a sentence based on the information provided only by the grammar. We correct and extend the RTP by various linguisticall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity Search in Trajectory Databases

    Publication Year: 2007, Page(s):129 - 140
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    Trajectory database (TD) management is a relatively new topic of database research, which has emerged due to the explosion of mobile devices and positioning technologies. Trajectory similarity search forms an important class of queries in TD with applications in trajectory data analysis and spatiotemporal knowledge discovery. In contrast to related works which make use of generic similarity metric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comparison of Statistical and Rule-Induction Learners for Automatic Tagging of Time Expressions in English

    Publication Year: 2007, Page(s):141 - 149
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    Proper recognition and handling of temporal information contained in a text is key to understanding the flow of events depicted in the text and their accompanying circumstances. Consequently, time expression recognition and representation of the time information they convey in a suitable normalized form is an important task relevant to several problems in Natural Language Processing. In particular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries

    Publication Year: 2007, Page(s):150 - 162
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB) | HTML iconHTML

    Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected with the construction of space-bounded synopses that enable answering of continuous queries over unbounded data streams while requiring only limited space. We link the problem to the problem of query-driven data expirati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bi-Intervals for Backtracking on Temporal Constraint Networks

    Publication Year: 2007, Page(s):163 - 168
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB) | HTML iconHTML

    Checking satisfiability of temporal constraint networks involves infinite variables domains. We explore a solution based upon finite partitions of infinite domains. Though a straightforward partition results in a sound and complete backtrack, its extension to forward checking is not complete. Using bi-intervals, we obtain sound and complete backtrack and forward checking algorithms. Moreover, we s... View full abstract»

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