Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)

19-20 May 1996

Filter Results

Displaying Results 1 - 25 of 33
  • Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)

    Publication Year: 1996
    Request permission for reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Using temporal logics for planning and control

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

    Traditionally, planning work in artificial intelligence has focused on primitive actions and instantaneous states. Innovative work has been done on composing primitive actions so as to bring about desired final states. The thesis advanced in this paper is that instead of simply focusing on primitive actions, it is also useful to use representation and reasoning tools whose primitive objects are se... View full abstract»

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

    Publication Year: 1996
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    Discusses semantic remodeling; temporal geometry; theories of states and paths; a hierarchy of modal fragments; correspondence and constraints; and model constructions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about concurrent actions within features and fluents

    Publication Year: 1996, Page(s):6 - 13
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (767 KB)

    E. Sandewall (1994) proposed a systematic assessment method for temporal logics. In favour of the assessment of logics, we have introduced concurrency into his framework. The resulting formalism is capable of reasoning about interdependent as well as independent concurrent actions. We have then applied the entailment criteria PCM (prototypical chronological minimization of change) and PCMF (filter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time in a causal theory

    Publication Year: 1996, Page(s):14 - 20
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (583 KB)

    Discusses the temporal aspects of a causal theory based on an "interventionist" conception of causality, i.e. a preference to select causes among a set of actions which an agent has the ability to perform or not to perform (free will). Casting causal reasoning in this framework leads to explore the problem of reasoning about actions, generally considered as a nonmonotonic temporal reasoning. Most ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of time and temporal incidence based on instants and periods

    Publication Year: 1996, Page(s):21 - 28
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (798 KB)

    Time is fundamental in representing and reasoning about changing domains. A proper temporal representation requires characterizing two notions: (1) time itself, and (2) temporal incidence, i.e. the domain-independent properties for the truth-value of fluents and events throughout time. There are some problematic issues, such as the expression of instantaneous events and instantaneous holding of fl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing disjunctions of temporal constraints

    Publication Year: 1996, Page(s):30 - 35
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Describes new algorithms for processing quantitative temporal constraint satisfaction problems (TCSPs). In contrast to discrete CSPs, enforcing path consistency on TCSPs is exponential due to the fragmentation problem. We present an efficient polynomial constraint propagation algorithm, called "loose-path consistency" (LPC), which is shown to improve the performance of backtrack search algorithms ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning with sequences of point events

    Publication Year: 1996, Page(s):36 - 38
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (319 KB)

    Proposes the modeling of recurring events as multi-point events by extending Vilain and Kautz's (1986) point algebra. We then propose an exact algorithm, based on van Beek's (1990) exact algorithm, for finding feasible relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid temporal reasoning for planning and scheduling

    Publication Year: 1996, Page(s):39 - 44
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (741 KB)

    This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaining efficiency and flexibility in the simple temporal problem

    Publication Year: 1996, Page(s):45 - 50
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (605 KB)

    Deals with the problem of managing quantitative temporal networks without disjunctive constraints. This problem is known as the "simple temporal problem". Dynamic management algorithms are considered to be coupled with incremental constraint posting approaches for planning and scheduling. A basic algorithm for incremental propagation of a new time constraint is presented which is a modification of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic programming with temporal constraints

    Publication Year: 1996, Page(s):51 - 56
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (587 KB)

    Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal constraint networks are applied. We identify a decidable fragment called Simple TCLP, which can be viewed as extending Datalog with limited functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networks of qualitative interval relations: combining circuit consistency and path consistency in the search for a solution

    Publication Year: 1996, Page(s):57 - 62
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We first define the concept of circuit consistency for interval networks. We then provide an example showing that even for atomic networks circuit consistency is not complete. Then we describe how to combine circuit consistency and path consistency in existing search algorithms. Instead of applying path-consistency at each node of the search tree, as do existing algorithms, the idea of our method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic temporal interpretation contexts for temporal abstraction

    Publication Year: 1996, Page(s):64 - 71
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    The temporal-abstraction task is the task of abstracting higher-level concepts from time-stamped data in a context-sensitive manner. We have developed and implemented a formal knowledge-based framework for decomposing and solving that task that supports acquisition, maintenance, reuse, and sharing of temporal-abstraction knowledge. We present the logical model underlying the representation and run... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing interaction of agents at different time granularities

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

    In this paper we describe NatureTime logic which we use to represent and reason about the behaviour of interacting agents (in an ecological domain), which behave at different time granularities. Although the traditional application fields of temporal representation and reasoning still raise many interesting theoretical issues, we have been investigating some practical problems of ecological system... View full abstract»

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

    Publication Year: 1996, Page(s):80 - 87
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1023 KB)

    This paper is a preliminary investigation of temporal repetition. We review work in Artificial Intelligence of both formal and practical systems that deal with repetitive temporal objects (i.e. repetitive points and/or intervals). We analyze the essence of repetition, and present an extensive classification of types of repetition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing time granularity of narrative clinical information: the temporal data model TIME-NESIS

    Publication Year: 1996, Page(s):88 - 93
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    In the database field, the need of time management at different levels of granularity has been on for some years. It has been recently emphasized. Such a need is widespread when we have to manage medical clinical information. The temporal dimension is normally given at different granularities. In database systems based on the calendar time, granularity refers to uncertainty in specifying a tempora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive temporal algebra and temporal completeness

    Publication Year: 1996, Page(s):96 - 103
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (735 KB)

    This paper introduces a recursive temporal algebra based on temporal semantics for querying time-varying data. The algebra, called /spl Rfr/*, is based on a temporal relational data model in which a temporal database is modeled as a collection of time-varying relations. Each time-varying relation is a collection of ordinary relations indexed by moments in time. In /spl Rfr/*, recursive queries (su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general framework and reasoning models for time granularity

    Publication Year: 1996, Page(s):104 - 111
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    This paper presents a general framework to define time granularity systems. We identify the main choices differentiating the systems and investigate the formal relationships among granularities in these systems. The paper also introduces the notion of a network of temporal constraints with granularities emphasizing the semantical and computational differences from constraint networks with a single... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining simultaneous values and temporal data dependencies

    Publication Year: 1996, Page(s):112 - 117
    Cited by:  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (605 KB)

    In temporal databases there are situations where multiple values of the same data item have overlapping validity times. In addition to the common case of multi-valued properties, there are several possible semantics to multiple values with overlapping validity times of the same data item. We refer to such data items as having simultaneous values. This paper presents a polynomial algorithm for effi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal resolution: a breadth-first search approach

    Publication Year: 1996, Page(s):120 - 127
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    An approach to applying clausal resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution between states. The method consists of only one temporal resolution rule and is therefore particularly suitable as the basis of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal reasoning in a meta constraint logic programming architecture

    Publication Year: 1996, Page(s):128 - 135
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    Constraint Logic Programming (CLP) is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an "arc consistency" propagation algorithm which cannot be changed by the user and it is too weak in many temporal frameworks. Second, CLP is not able t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrity constraint checking method for temporal deductive databases

    Publication Year: 1996, Page(s):136 - 141
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (655 KB)

    The authors propose a method for integrity checking in the context of temporal deductive databases. A temporal deductive database is a deductive database that supports some aspect of time, in our case valid time, in which valid time is the time when the fact is true in the modelled reality. Their method augments a database with a set of transition and event rules, which explicitly define the inser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guiding and refining simulation using temporal logic

    Publication Year: 1996, Page(s):144 - 151
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (885 KB)

    We illustrate TeQSIM, a qualitative simulator for continuous dynamical systems. It combines the expressive power of qualitative differential equations with temporal logic by interleaving simulation with model checking to constrain and refine the resulting predicted behaviors. Temporal logic expressions are used to specify constraints that restrict the simulation to a region of the state space and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal knowledge representation and organization for case-based reasoning

    Publication Year: 1996, Page(s):152 - 159
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (803 KB)

    The article presents the temporal knowledge representation and its organization in a case-based reasoning system called MNAOMIA. The general case-based reasoning methodology is grounded on a model of reasoning such that memory, learning and reasoning are inseparable. This particular focus forces pertinent knowledge representation and organization in the system memory. The main aspects of the tempo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Engineering time in medical knowledge-based systems through time-axes and time-objects

    Publication Year: 1996, Page(s):160 - 167
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Starting from the premise that time representation and temporal reasoning must constitute integral aspects of a competent, knowledge-based, medical system, the paper presents the relevant requirements and discusses their realisation in terms of a generic temporal kernel to be embedded in such a system. The kernel has a layered architecture where the bottom layer gives the ontological primitives an... View full abstract»

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