Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.

3-3 July 2004

Filter Results

Displaying Results 1 - 25 of 34
  • Proceedings 11th International Symposium on Temporal Representation and Reasoning

    Publication Year: 2004, Page(s): ii
    Request permission for reuse | PDF file iconPDF (481 KB)
    Freely Available from IEEE
  • Proceedings. 11th International Symposium on Temporal Representation and Reasoning (TIME 2004)

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): iv
    Request permission for reuse | PDF file iconPDF (186 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):v - vi
    Request permission for reuse | PDF file iconPDF (199 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2004, Page(s): vii
    Request permission for reuse | PDF file iconPDF (176 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Co-Chairs

    Publication Year: 2004, Page(s): viii
    Request permission for reuse | PDF file iconPDF (180 KB) | HTML iconHTML
    Freely Available from IEEE
  • Steering Committee and symposium officers

    Publication Year: 2004, Page(s):ix - xi
    Request permission for reuse | PDF file iconPDF (217 KB)
    Freely Available from IEEE
  • Organizing Committee and additional referees

    Publication Year: 2004, Page(s): xii
    Request permission for reuse | PDF file iconPDF (175 KB)
    Freely Available from IEEE
  • Toward a unifying view of point and interval temporal data models

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

    The association of timestamps with various data items is fundamental to the management of time-varying information because it has a pervasive effect on most aspects of a data model. Using intervals in timestamps, as do most data models, leaves a data model with a variety of choices for giving a meaning to timestamps. Specifically, some data models claim to be point-based while other data models cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Word proximity constraints: information retrieval meets temporal reasoning

    Publication Year: 2004, Page(s):5 - 6
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    We study the data models WP and AWP that have been widely used for many years in the area of information retrieval. WP and AWP can be used to represent and query textual information under the Boolean model using the concepts of attributes with values of type text, and word proximity constraints. Variations of WP and AWP are in use in most deployed digital libraries using the Boolean model, text ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal prepositions and their logic: extended abstract

    Publication Year: 2004, Page(s):7 - 8
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    This extended abstract reports on the computational complexity of reasoning with English sentences featuring temporal prepositions. A fragment of English featuring these constructions, called TPE, is defined by means of a context-free grammar. The phrase-structures which this grammar assigns to the sentences it recognizes can be viewed as formulas of an interval temporal logic, called TPL, whose s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The many ways of facing temporal uncertainty in planning and scheduling

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

    Generating off line a plan of activities before executing it on line is no longer realistic when one expects disturbances from an uncertain environment. Focusing on temporal plans and uncertain temporal constraints, we show that there are three main ways of tackling the issue: the reactive way, the proactive way and the progressive way, which are illustrated through existing models and systems. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lattice of classes of user-defined symbolic periodicities

    Publication Year: 2004, Page(s):13 - 20
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (772 KB) | HTML iconHTML

    User-defined calendars and periodicities are gaining an increasing relevance in AI and DB theory and applications. Thus several representation languages have been introduced to model them. Even focusing the attention on symbolic languages only, several different proposals can be chosen, and the comparisons between them are not trivial at all. In this paper, we propose a lattice of properties about... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mathematical framework for the semantics of symbolic languages representing periodic time

    Publication Year: 2004, Page(s):21 - 27
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (665 KB) | HTML iconHTML

    In several areas, including temporal databases, Presburger arithmetic has been chosen as a standard reference to express the semantics of languages representing periodic time, and to study their expressiveness. On the other hand, the proposal of most symbolic languages in the AI literature has not been paired with an adequate semantic counterpart, making the task of studying the expressiveness of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The SOL time theory: a formalization of structured temporal objects and repetition

    Publication Year: 2004, Page(s):28 - 35
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    We propose to formally represent time with structured temporal objects. Structured temporal objects denote related time intervals (and recursively, related temporal objects) which are conceived as structured objects, rather than relations among such intervals. The major emphasis in this approach is on temporal repetition. To that effect, a new temporal object, the time loop, is defined. The intent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A possibility theory-based approach to the handling of uncertain relations between temporal points

    Publication Year: 2004, Page(s):36 - 43
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    Uncertain relations between temporal points are represented by means of possibility distributions over the three basic relations "smaller than", "equal to", and "greater than". Operations for computing inverse relations, for composing relations, for combining relations coming from different sources and pertaining to the same temporal points, or for representing negative information, are defined. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relations between fuzzy time intervals

    Publication Year: 2004, Page(s):44 - 51
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    Time intervals like "tonight", which are usually not very precise, can be modeled as fuzzy sets. But this causes the problem that the relations between points and intervals and between two intervals, which are usually very trivial, become very complex when the intervals are fuzzy sets. Moreover, there are many different possibilities to define such relations. In this paper a very flexible operator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive representation of periodicity and temporal reasoning

    Publication Year: 2004, Page(s):52 - 59
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    Representing and reasoning with repeated and periodic events is important in many real-world domains, such as protocol and guideline management. In this set, it is important to give support to complex periodicities, that can involve non-symmetric repetitions, imprecision, variability, pauses between repetitions, and nested time intervals. Also, in these domains it can be useful to give support to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of labelled partitionings for modelling periodic temporal notions

    Publication Year: 2004, Page(s):60 - 63
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    The key notion for modelling calendar systems as well as many periodic events, for example the seasons, is the notion of a partitioning of the real numbers. A partitioning of R splits the time axis into a finite or infinite sequence of intervals. Basic time units like seconds, minutes, hours, days, weeks, months, years etc. can all be represented by finite partitionings of R. There are a lot of ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic temporal interval networks

    Publication Year: 2004, Page(s):64 - 67
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    A probabilistic temporal interval network is a constraint satisfaction problem where the nodes are temporal intervals and the edges are uncertain interval relations. We attach a probability to each of Allen's basic interval relations. An uncertain relation between two temporal intervals is represented as a disjunction of Allen's probabilistic basic relations. Using the operations of inversion, com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy calendar algebra and its applications to data mining

    Publication Year: 2004, Page(s):71 - 78
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (428 KB) | HTML iconHTML

    Temporal expressions are widely used in our daily life. Calendar algebra has been studied for years to provide a formal specification for constructing temporal expressions. However, temporal requirements specified by human beings tend to be ill-defined or uncertain. To deal with such kind of uncertain information, we propose the fuzzy calendar algebra which allows users to describe desired tempora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning on temporal conceptual schemas with dynamic constraints

    Publication Year: 2004, Page(s):79 - 86
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    This paper formally clarifies the relevant reasoning problems for temporal EER diagrams. We distinguish between the following reasoning services: (a) entity, relationship and schema satisfiability; (b) liveness and global satisfiability for both entities and relationships; (c) subsumption for either entities or relationships; and (d) logical implication between schemas. We then show that reasoning... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pre-processing time constraints for efficiently mining generalized sequential patterns

    Publication Year: 2004, Page(s):87 - 95
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    In this paper we consider the problem of discovering sequential patterns by handling time constraints. While sequential patterns could be seen as temporal relationships between facts embedded in the database, generalized sequential patterns aim at providing the end user with a more flexible handling of the transactions embedded in the database. We propose a new efficient algorithm, called GTC (gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping calendar expressions into periodical granularities

    Publication Year: 2004, Page(s):96 - 102
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (335 KB) | HTML iconHTML

    An effort has been devoted in the recent years to study and formalize the concept of time granularity and to design applications and services using the formalization. Among other proposals, a calendar algebra has been defined to facilitate the specification of new granularities and to perform conversions among them. This paper shows how granularities defined as algebraic calendar expressions can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Max-count aggregation estimation for moving points

    Publication Year: 2004, Page(s):103 - 108
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    Many interesting problems regarding moving objects can be reduced to the following question: Given a set S of moving points on a line and two other movings points A and B on the same line, what is the maximum number of points in S that will be simultaneously between A and B within a time interval (t/sub 1/, t/sub 2/)? We propose an algorithm that can estimate the answer for arbitrary A and B and a... View full abstract»

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