Proceedings Ninth International Symposium on Temporal Representation and Reasoning

7-9 July 2002

Filter Results

Displaying Results 1 - 25 of 25
  • Proceedings Ninth International Symposium on Temporal Representation and Reasoning

    Publication Year: 2002
    Request permission for reuse | PDF file iconPDF (342 KB)
    Freely Available from IEEE
  • On non-local propositional and local one-variable quantified CTL*

    Publication Year: 2002, Page(s):2 - 9
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    We prove decidability of 'non local' propositional CTL*, where truth values of atoms may depend on the branch of evaluation. This result is then used to show decidability of the 'weak' one-variable fragment of first-order (local) CTL*, in which all temporal operators and path quantifiers except 'tomorrow' are applicable only to sentences. Various spatio-temporal logics based on combinations of CTL... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the operational semantics of timed rewrite systems

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

    We propose an efficient operational semantics for a new class of rewrite systems, namely timed rewrite systems. This class constitute a conservative extension of first-order conditional term rewrite systems together with time features such as clocks, signals, timed terms, timed atoms and timed rules. We define first timed rewrite systems and illustrate them through some examples. A naive approach ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a comprehensive treatment of temporal constraints in clinical guidelines

    Publication Year: 2002, Page(s):20 - 27
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (591 KB) | HTML iconHTML

    In this paper, we focus on an application and extension of artificial intelligence temporal reasoning techniques in order to represent and reason with temporal constraints in clinical guidelines. Particular attention is dedicated to the treatment of repeated (periodic) events, which play a major role in clinical therapies. We also discuss some limitations of our current approach, highlighting poss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the point algebra into the qualitative algebra

    Publication Year: 2002, Page(s):28 - 35
    Cited by:  Papers (1)
    Request permission for reuse | PDF file iconPDF (420 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning with disjunctive fuzzy temporal constraint networks

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

    The disjunctive fuzzy temporal constraint network (DFTCN) model is a framework that allows reasoning with fuzzy qualitative and quantitative complex temporal constraints. However, its general complexity is exponential. In this work, we review methods that can reduce this complexity, based on graph topology and preprocessing. The final goal is to integrate all these methods into a general tool for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation and reasoning with disjunctive temporal constraints

    Publication Year: 2002, Page(s):46 - 48
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    We show the expressiveness provided by a labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to manage disjunctive assertions, conjunctive and hypothetical queries, and one-to-many constraints. Additionally, it becomes an adequate support for reasoning on costs associated to constraints. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the RETE algorithm for event management

    Publication Year: 2002, Page(s):49 - 51
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    A growing number of industrial applications use rule-based programming. Frequently, the implementation of the inference engine embedded in these applications is based on the RETE algorithm. Some applications supervise a flow of events in which time, through the occurrence dates of the events, plays an important role. These applications need to be able to recognize patterns involving events. Howeve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stratified causal theories for reasoning about deterministic devices and protocols

    Publication Year: 2002, Page(s):52 - 54
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    We present a method for formalising the behaviour of simple deterministic devices and protocols in a way that makes explicit the causal dependencies amongst the component elements, thereby allowing true causal (as opposed to purely temporal) reasoning. Our intention is to handle such systems effectively in the simplest possible way, without invoking additional problematic considerations (concernin... View full abstract»

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

    Publication Year: 2002, Page(s):55 - 57
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    We introduce a temporal logic to reason on global applications. First, we define a modal logic for localities that embeds the local theories of each component into a theory of the distributed states of the system. We provide the logic with a sound and complete axiomatization. Then, we extend the logic with a temporal operator. The contribution is that it is possible to reason about properties that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of querying temporal attributes in object-relational databases

    Publication Year: 2002, Page(s):58 - 60
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    We evaluate a model for temporal data utilizing the benefits of object-relational database systems (ORDBS). In particular we show how attribute timestamping can be efficiently implemented in state-of-the-art ORDBS. The attribute timestamping concept is based on introducing user-specific types for temporal versions of datatypes. Moreover on the physical level we make use of user-defined index struc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parameterized algebra for event notification services

    Publication Year: 2002, Page(s):61 - 63
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Event notification services are used in various applications such as digital libraries, stock tickers, traffic control, or facility management. However to our knowledge, a common semantics of events in event notification services has not been defined so far. We propose a parameterized event algebra which describes the semantics of composite events for event notification systems. The parameters ser... View full abstract»

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

    Publication Year: 2002, Page(s):66 - 67
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    Summary form only given. Data expiration is an essential component of data warehousing solutions: whenever large amounts of data are repeatedly collected over a period of time, it is essential to have a clear approach to identifying parts of the data no-longer needed and a policy that allows disposing and/or archiving these parts of the data. Such policies are necessary even if adding storage to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index based processing of semi-restrictive temporal joins

    Publication Year: 2002, Page(s):70 - 77
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    Temporal joins are important but very costly operations. While a temporal join can involve the whole time (and/or key) domain, we consider the more general case where the join is defined by some time-key rectangle from the whole space (i.e., when the user is interested in joining portions of the-usually large-temporal data). In the most restrictive join, objects (within this rectangle) are joined ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution specification of multigranular temporal objects

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

    The main key feature of temporal databases is to maintain all values taken by object attributes over time. Since historical information may be needed at different levels of detail, multigranular temporal databases have been introduced, in which different attributes can be stored at different temporal granularities. An important issue that has not been addressed, however is that the required level ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A similarity search method of time series data with combination of Fourier and wavelet transforms

    Publication Year: 2002, Page(s):86 - 92
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    Time-series data, such as stock exchange rates and weather data, has widely been used in many fields. Similarity search of time-series data is important because it is useful for predicting data changes and searching for common sources. In this paper, we propose a new similarity search method of time-series data using both a discrete Fourier transform (DFT) and wavelet transform (WT). A method of r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying local search to temporal reasoning

    Publication Year: 2002, Page(s):94 - 99
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Local search techniques have attracted considerable interest in the artificial intelligence (AI) community since the development of GSAT (Selman et al., 1992) and the min-conflicts heuristic (Minton et al., 1992) for solving large propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal reasoning with classes and instances of events

    Publication Year: 2002, Page(s):100 - 107
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    Representing and reasoning with both temporal constraints between classes of events (e.g., between the types of actions needed to achieve a goal) and temporal constraints between instances of events (e.g., between the specific actions being executed) is a ubiquitous task in many areas of computer science, such as planning, workflow, guidelines and protocol management. The temporal constraints betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A continuous planning framework with durative actions

    Publication Year: 2002, Page(s):108 - 114
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    This paper describes a continuous planning framework to be used by a planning agent situated within an environment, which reasons about goals with priorities and deadlines, and actions with duration. The framework assumes that goals may be generated continuously, which requires the interleaving of planning and execution. Constraints upon time may mean it is not possible for all goals to be achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal views as abstract relations

    Publication Year: 2002, Page(s):116 - 123
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    Many natural languages use prepositions to mark relations between entities of various kinds-between physical entities and their spatial locations, between temporal entities and their temporal locations, between abstract entities of various kinds (e.g. between ideas and their 'mental locations'). I show that the consequences of using prepositions to relate temporal entities emerge naturally from th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A finite-state approach to event semantics

    Publication Year: 2002, Page(s):124 - 131
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with partial valuations. The usual regular constructs (concatenation, choice, etc) are supplemented with superposition of strings/a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logical approach to represent and reason about calendars

    Publication Year: 2002, Page(s):134 - 140
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    We propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and we intensively model sets of granularities with linear time logic formulas. Some real-world granularities are provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tensed ontology based on simple partial logic

    Publication Year: 2002, Page(s):141 - 145
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    Simple partial logic (SPL) is, broadly speaking, an extensional logic which allows for the truth-value gap. First I give a system of propositional SPL by partializing classical logic, as well as extending it with several non-classical truth-functional operators. Second I show a way based on SPL to construct a system of tensed ontology, by representing tensed statements as two kinds of necessary st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexed flows in temporal /spl times/ modal logic with functional semantics

    Publication Year: 2002, Page(s):146 - 153
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    Two classical semantical approaches to studying logics which combine time and modality are the T /spl times/ W-frames and Kamp-frames (Thomason (1984)). In this paper we study a new kind of frame that extends the one introduced in Burrieza et al. (2002). The motivation is twofold: theoretical, i.e., representing properties of the basic theory of functions (definability); and practical, their use i... View full abstract»

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

    Publication Year: 2002, Page(s): 154
    Request permission for reuse | PDF file iconPDF (176 KB)
    Freely Available from IEEE