Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000

7-9 July 2000

Filter Results

Displaying Results 1 - 23 of 23
  • Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000

    Publication Year: 2000
    Request permission for reuse | PDF file iconPDF (151 KB)
    Freely Available from IEEE
  • Representing and reasoning with temporal constraints in multimedia presentations

    Publication Year: 2000, Page(s):3 - 11
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    With the growing use of computers to create technical, business and personal presentations, there has been a huge increase in the number of multimedia presentation tools out in the market. Thus, over the coming years, there will be a growing need to build the ability to query rapidly databases consisting of interactive multimedia presentations. The MPA algebra proposed by Adali et al. provides a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formalization of structured temporal objects and repetition

    Publication Year: 2000, Page(s):13 - 20
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (241 KB)

    We propose an approach to formally representing structured temporal objects. These new temporal objects are recursively made up of convex intervals and Allen's convex relations. The major emphasis in our approach is on temporal repetition. To that effect we define the time loop. Time loops allow us to abstract common elements in repetitive temporal patterns. A loop is parameterized by a cycle whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about generalized intervals: Horn representability and tractability

    Publication Year: 2000, Page(s):23 - 29
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (237 KB)

    This paper organizes the topologic forms of the possible relations between generalized intervals. Working out generalized interval algebra on the pattern of point algebra and interval algebra, it introduces the concept of Horn representability just as the one of convexity. It gives the class of Horn representable relations a simple characterization based on the concept of strong preconvexity. Adap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Free schedules for free agents in workflow systems

    Publication Year: 2000, Page(s):31 - 37
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (229 KB)

    This paper investigates workflow systems in which the enactment and completion of activities have to satisfy a set of quantitative temporal constraints. Different activities are usually performed by autonomous agents, and the scheduling of activities by the enactment service has among its goals the minimization of communication and synchronization among the agents. The paper formally defines the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient resolution mechanism for fuzzy temporal constraint logic

    Publication Year: 2000, Page(s):39 - 46
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (210 KB)

    In this paper we describe a module, the temporal solving module (TSM), for answering queries sent to a data blackboard which must take into account fuzzy temporal constraints among blackboard variables. The TSM receives the queries written in an interaction language that is translated into a language of a reified many-sorted first-order logic, called fuzzy temporal constraint logic (FTCL). This lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A calculus of macro-events: progress report

    Publication Year: 2000, Page(s):47 - 58
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The need for constraining the temporal relationships among sets of related events arises in several temporal reasoning tasks, including monitoring, plan validation, planning and diagnosis. Process constructors provide an effective way of packaging related events into individual conceptual chunks, called macro-events. In this paper, we present a first attempt at defining a calculus of macro-events ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling temporal aspects of visual and textual objects in multimedia databases

    Publication Year: 2000, Page(s):59 - 68
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We consider the problem of modeling temporal aspects of visual and related textual entities in multimedia databases, within the framework of an object-oriented temporal data model. We distinguish two different time aspects in multimedia visual data: intrinsic time, i.e., the time managed according to the sequence of frames composing a visual data item, and extrinsic time, i.e., the (valid) time of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution-based proof for multi-modal temporal logics of knowledge

    Publication Year: 2000, Page(s):69 - 78
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (271 KB)

    Temporal logics of knowledge are useful in order to specify complex systems in which agents are both dynamic and have information about their surroundings. We present a resolution method for propositional temporal logic combined with multi-modal S5 and illustrate its use on examples. This paper corrects a previous proposal for resolution in multi-model temporal logics of knowledge. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closure properties of classes of spatio-temporal objects under Boolean set operations

    Publication Year: 2000, Page(s):79 - 86
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    We study a model for spatio-temporal objects, introduced by Chomicki and Revesz (1999), in which spatio-temporal data is specified by a spatial reference object together with a geometric transformation that determines the movement of the reference object in time. We give complete results concerning closure under Boolean set operators for the different classes of spatio-temporal objects introduced ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending topological nexttime logic

    Publication Year: 2000, Page(s):87 - 94
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We provide an extension of topological nexttime logic by an operator expressing an increase of sets. The resulting formalism enables one to reason about the change of sets in the course of (discrete) linear time. We establish completeness and decidability of the new system, and determine its complexity. As for the latter, we obtain a 'low' upper complexity bound of the corresponding satisfiability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a theory of movie database queries

    Publication Year: 2000, Page(s):95 - 102
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (278 KB)

    We present a data model for movies and movie databases. A movie is considered to be a 2D semi-algebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided whether a frame of a movie is only a topologically transformation of another frame; a movie has a finite number of scenes and cuts and these can be effectively computed. Based on these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying multiple temporal granularity data

    Publication Year: 2000, Page(s):103 - 114
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    Managing and querying information with varying temporal granularities is an important problem in databases. Although there is a substantial body of work on temporal granularities for the relational data model (Snodgrass, 1995), a comprehensive framework is lacking for the object-oriented paradigm. To the best of our knowledge, a formal treatment of temporal queries with multiple granularities has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Behavior discovery as database scheme design

    Publication Year: 2000, Page(s):115 - 122
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (333 KB)

    In this investigation, we propose an inductive classification method for a collection of temporal information which mean behavior. We assume a Markov property and discuss ergodic analysis by which we can extract stationary parts of the behavior. We discuss a design methodology for database schemes based on the theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Navigating through hierarchical change propagation in spatiotemporal queries

    Publication Year: 2000, Page(s):123 - 131
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (218 KB)

    In spatiotemporal applications, meaningful changes vary according to object type, level of detail, and nature of application. We introduce a dynamic classification scheme and its interaction with a spatiotemporal model, to describe change propagation in spatiotemporal queries. Our classification is based on identifying three levels of change, ranging from simple verification of the continuous exis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An incremental batch-oriented index for bitemporal databases

    Publication Year: 2000, Page(s):133 - 141
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Bitemporal databases record not only the history of tuples in temporal tables, but also record the history of the databases themselves. We address the problem of indexing such bitemporal databases by investigating the use of an incremental indexing structure, the HR-tree, which was originally aimed at spatiotemporal databases. The HR-tree's most attractive feature is that it can process queries as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PMTV: a schema versioning approach for bi-temporal databases

    Publication Year: 2000, Page(s):143 - 151
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (286 KB)

    Most of the existing schema versioning approaches are developed for single time-dimension temporal databases. For bi-temporal databases, which allow both retroactive and proactive updates to the schema and database, these approaches introduce many problems and perform inefficiently. We first review two schema versioning approaches, single table versioning (STV) and multiple table versioning (MTV) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating positions and paths of moving objects

    Publication Year: 2000, Page(s):155 - 162
    Cited by:  Papers (2)  |  Patents (76)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Several applications require support for representing and analyzing moving objects. Such applications include wildlife tracking, emergency dispatch, vehicle navigation, fleet management, storm tracking, and military applications to name a few. Enhanced data collection technologies such as high resolution satellite imagery, videogrammetry and GPS in combination with wireless communications are rapi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution for branching time temporal logics: applying the temporal resolution rule

    Publication Year: 2000, Page(s):163 - 172
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (338 KB)

    We propose algorithms to implement a branching time temporal resolution theorem prover. The branching time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. Unlike the majority of the research into temporal logic, we adopt a resolution-based approach. The method applies step and temporal resolution rules to the set of formulae in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization of medical therapy plans compared to Gantt and PERT charts

    Publication Year: 2000, Page(s):173 - 181
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB)

    Medical therapy planning shares a number of properties of project management. It is, however, different in a few very important aspects-most notably the more complex notion of time it requires. Asbru is a language that can represent medical therapy plans in terms of time-oriented, skeletal plans, but due to its formal nature, it cannot be used directly by physicians. Therefore, we developed a visu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal reasoning: a three way analysis

    Publication Year: 2000, Page(s):183 - 189
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB)

    The study of temporal representation and reasoning is a core area of research in linguistics, philosophy and artificial intelligence. However, very little work has been done in analysing the principles common to these three areas. We investigate major issues and approaches studied in these disciplines. We discovered the philosophical origin of Allen's (1983; 1984) interval algebra. We present an a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is point-based semantics always adequate for temporal databases?

    Publication Year: 2000, Page(s):191 - 199
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The analysis of the semantics of temporal data and queries plays a central role in the area of temporal relational databases. Although many different models and algebra have been proposed, almost all of them are based on a point-based (snapshot) semantics of the association of time to tuples/attributes. On the other hand, in the areas of linguistics, philosophy, and recently, artificial intelligen... View full abstract»

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

    Publication Year: 2000, Page(s): 201
    Request permission for reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE