Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99

2-2 May 1999

Filter Results

Displaying Results 1 - 15 of 15
  • Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99

    Publication Year: 1999
    Request permission for reuse | PDF file iconPDF (783 KB)
    Freely Available from IEEE
  • Introducing temporal description logics

    Publication Year: 1999, Page(s):2 - 5
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (125 KB)

    Description logics are formalisms designed for a logical reconstruction of representation tools such as frames, object oriented and semantic data models, semantic networks, type systems, and feature logics. Nowadays, description logics are also considered the most important unifying formalism for the many object centred representation languages used in areas other than knowledge representation. Im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual verification of temporal properties

    Publication Year: 1999, Page(s): 6
    Request permission for reuse | PDF file iconPDF (50 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for reasoning with nonconvex intervals

    Publication Year: 1999, Page(s):8 - 16
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1270 KB)

    We describe a new system of relations for reasoning about general, i.e., both convex and nonconvex, intervals of time. This system is essentially an integration of Allen's theory (J.F. Allen, 1981; 1984) and a one-dimensional version of the Region Connection Calculus of A.G. Cohn et al. (1997) and D.A. Randall et al. (1992). When dealing solely with convex intervals, this system reduces to Allen's... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic representation of user-defined time granularities

    Publication Year: 1999, Page(s):17 - 28
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (201 KB)

    In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to have a common framework for their specification, and to allow the interoperability of systems adopting different time granularities. The paper considers the mathematical characterization of finite and periodical time granul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constraint-based specification of periodic patterns in time-oriented data

    Publication Year: 1999, Page(s):29 - 40
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We use a constraint based language to specify periodic temporal patterns. The Constraint-based Pattern Specification Language (CAPSUL) is simple to use, but allows a wide variety of patterns to be expressed. CAPSUL solves problems such as: (1) how to use calendar based constraints to define repetition of a periodic event; (2) what temporal relations must exist between consecutive repeats of a patt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric framework for specifying spatiotemporal objects

    Publication Year: 1999, Page(s):41 - 46
    Cited by:  Papers (26)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (186 KB)

    We present a framework for specifying spatiotemporal objects using spatial and temporal objects, and a geometric transformation. We define a number of classes of spatiotemporal objects and study their closure properties. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TALplanner: an empirical investigation of a temporal logic-based forward chaining planner

    Publication Year: 1999, Page(s):47 - 54
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (166 KB)

    We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus (1998) and Kabanza (1997), where domain-dependent search control knowledge represented as temporal formulas is used to effectively control forward chaining. Instead of using a linear modal tense logic as with Bacchus and Kabanza, we use TAL, a narrative-based linear temporal logic used for reasoning about ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph-theoretic approach to efficiently reason about partially ordered events in the Event Calculus

    Publication Year: 1999, Page(s):55 - 66
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. We prove the sound... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating scenarios for periodic events with binary constraints

    Publication Year: 1999, Page(s):67 - 72
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Reasoning with repeating events differs from reasoning about single events primarily in the fact that with the former the available information about aspects such as the number and period of the events may be indefinite. Much useful knowledge about repeating events takes the form of relationships between "successive" occurrences of the same event, or "proximate" occurrences of pairs of repeating e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A temporal object-oriented data model with multiple granularities

    Publication Year: 1999, Page(s):73 - 81
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB)

    We investigate some issues arising from the introduction of multiple temporal granularities in an object-oriented data model. Although issues concerning temporal granularities have been investigated in the context of temporal relational database systems, no comparable amount of work has been done in the context of object-oriented models. Moreover, the main drawback of the existing proposals is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization in constraint reasoning about repeating events

    Publication Year: 1999, Page(s):82 - 87
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (190 KB)

    The effective manipulation of temporal information about periodic events is required for solving complex problems such as long range scheduling or querying temporal information. Furthermore, many problems involving repeating events require the optimization of temporal aspects of these events, e.g., minimizing makespan in job-shop scheduling. This paper contains a framework for representing and sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study and comparison of schema versioning and database conversion techniques for bi-temporal databases

    Publication Year: 1999, Page(s):88 - 98
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (199 KB)

    Schema evolution and schema versioning are two techniques used for managing database evolution. Schema evolution keeps only the current version of a schema and database after applying schema changes. Schema versioning creates new schema versions and converts the corresponding data while preserving the old schema versions and data. To provide the most generality, bi-temporal databases can be used t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A temporal relational algebra based on multiple time-lines

    Publication Year: 1999, Page(s):100 - 105
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    A clocked temporal relational algebra, called /spl Rfr/, which supports temporal relations based on multiple time-lines is proposed. Temporal relations are defined over clocks which are subsequences of an assumed global time-line. The algebra is a consistent extension of the relational algebra, and it includes a number of temporal operators to combine data based on different time-lines. The meanin... View full abstract»

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

    Publication Year: 1999, Page(s): 106
    Request permission for reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE