Proceedings. Fifth International Workshop on Temporal Representation and Reasoning (Cat. No.98EX157)

17-17 May 1998

Filter Results

Displaying Results 1 - 25 of 28
  • Proceedings. Fifth International Workshop on Temporal Representation and Reasoning (Cat. No.98EX157)

    Publication Year: 1998
    Request permission for reuse | PDF file iconPDF (252 KB)
    Freely Available from IEEE
  • Temporal reasoning in plan management

    Publication Year: 1998
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (37 KB)

    Summary form only. While the traditional planning problem can be viewed as a temporal reasoning problem in the abstract, most planning algorithms use specialized constrained representations that are only useful for the planning task. In the TRIPS system, we need to build complex plans, but also to reason about them in different ways in order to modify plans, consider the effects of different plans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accounting for temporal evolutions in highly reactive decision-making

    Publication Year: 1998, Page(s):3 - 10
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (218 KB)

    Applications such as aircraft combat simulation require both dynamic supervision and real-time decision-making: actions and observations interact in a reactive way, and durations between two events must be accounted for. We start from a decision-tree model, which owns strong context handling capabilities, but provides only static decision-making. We improve it by matching possible temporal chronic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based visualization of temporal abstractions

    Publication Year: 1998, Page(s):11 - 20
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    We describe a domain-independent framework (KNAVE) specific to the task of interpretation, summerization, visualization, explanation, and interactive navigation in a context-sensitive manner through time-oriented raw data and the multiple levels of higher-level, interval-based concepts that can be abstracted from these data. The KNAVE domain-independent navigation operators access the domain-speci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uncertain temporal reasoning for the distributed transportation scheduling problem

    Publication Year: 1998, Page(s):21 - 28
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (105 KB)

    Distributed artificial intelligence (DAI) is suitable to applications where there is no central control. One of these applications with which we are concerned is transportation scheduling. We have noticed that all the approaches dedicated to this application use a weak representation of time and simple reasoning. Furthermore, these approaches ignore the uncertain behavior of agents. We propose an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for time granularity in natural language

    Publication Year: 1998, Page(s):29 - 36
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (121 KB)

    We propose a model for dealing with time granularity in natural language. In contrast with many other fields where granularity levels are essentially quantitative, in natural language we are confronted with a more subtle and qualitative kind of granularity where the different levels are not always precisely defined. Our model representing such phenomena is based on time units and intervals. Time u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended message sequence charts with time-interval semantics

    Publication Year: 1998, Page(s):37 - 44
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (59 KB)

    The paper describes the main ideas of an extension of Message Sequence Charts (MSCs) in a time-interval structure to improve the temporal knowledge of the environment where a software system will be built. The extended MSC could be used at the requirements analysis phase and its interpretation is not limited to the analysis of real-time software systems (where MSCs are mostly used), but rather is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal data obsolescence: modelling problems

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

    Data and knowledge bases model certain aspects of the world. When the state of the world changes faster than our ability to discover these state changes and update the data repositories accordingly, the confidence on the validity of data decays with time, and software systems running in such environments have to cope with the decay of confidence in the data lest they run the risk of giving wrong a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A temporal object query language

    Publication Year: 1998, Page(s):51 - 57
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (90 KB)

    One of the main reasons that current commercial DBMSs provide only minimal support for temporal concepts is the size and complexity involved. Object-oriented databases, on the other hand, were developed to deal with complex database applications. Because temporal concepts require complex type support and advanced modeling concepts, object-oriented databases are excellent candidates for realization... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualitative temporal reasoning: theory and practice

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

    Summary form only. The theory of qualititative temporal reasoning has evolved considerably in the last 15 years. We now know large tractable subsets of the interval algebra and have efficient inference algorithms for the full algebra. However, there are not many applications that make use of these results. I first sketch the development of the theory of qualitative temporal reasoning and then repo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating instantiations of contextual scenarios of periodic events

    Publication Year: 1998, Page(s):61 - 68
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (42 KB)

    We consider an expressive formalism to deal with temporal constraints between periodic events which takes into account different components such as frame times, numeric quantification, periods, and qualitative temporal constraints. We define the notions of (contextual) concretization of temporal constraints in such a formalism and of the (contextual) scenario of a knowledge base of temporal constr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualitative and quantitative temporal reasoning with points and durations

    Publication Year: 1998, Page(s):69 - 73
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (167 KB)

    This paper extends the point duration network (PDN) of Navarrete and Marin (1997) to represent both qualitative and quantitative information about point events. An algorithm to solve reasoning tasks such as finding a consistent scenario with minimal domains is briefly described. We also propose a further extension to capture quantitative information about durations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative structural temporal constraints on repeating events

    Publication Year: 1998, Page(s):74 - 80
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (127 KB)

    Presents a model of the temporal structure of repeating events. This model allows for the specification of constraints dealing with the part-whole structure of these events. The temporal structure of repeating events is viewed as being composed of six aspects: sub-interval number, gap number, sub-interval duration, gap duration, period and extent. A set of constraints involving these aspects colle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event Calculus with explicit quantifiers

    Publication Year: 1998, Page(s):81 - 88
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    Kowalski and Sergot's (1986) Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. We extend this calculus to give a semantic foundation to our Quantifiers and Connectives Event Calculus (QCEC). In particular, we extend the range of queries accepted... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logic of action, causality, and the temporal relations of events

    Publication Year: 1998, Page(s):89 - 96
    Cited by:  Papers (27)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (178 KB)

    Proposes a logic of action and causality, called /spl Cscr//spl Ascr//spl Lscr/ (Causality and Action Logic). The most important part of our contribution is a semantics that integrates action, temporal structure and probability. The semantics is based on a mathematical structure called an event space. This space is inhabited by situations or instantaneous events with binary relations over them. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tackling the qualification problem using fluent dependency constraints: preliminary report

    Publication Year: 1998, Page(s):97 - 104
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (85 KB)

    The use of causal rules, or fluent dependency constraints, has proven to provide a versatile means of dealing with the ramification problem. In this paper, we show how fluent dependency constraints, together with the use of durational fluents, can be used to deal with problems associated with action qualification. We provide both a weak and a strong form of qualification and demonstrate the approa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding a timing system in TLC

    Publication Year: 1998, Page(s):105 - 112
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (178 KB)

    This paper introduces the notion of timing systems, which can be used to represent multiple granularities of time in a natural and intuitive manner. A timing system consists of a number of clocks, including a global clock, which are usually specified by temporal logic programs. We propose an approach to embed such a timing system in TLC (Temporal Logic with Clocks), such that this logic can effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Set of Support strategy in temporal resolution

    Publication Year: 1998, Page(s):113 - 120
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (98 KB)

    A variety of proof methods have been developed to support the effective mechanisation of temporal logic. While clausal temporal resolution has been successfully employed for a range of problems, a number of improvements are still required. In particular, as there is no consistent control strategy underlying the method, and a large amount of irrelevant information may sometimes be generated. Follow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to model and query event-based temporal data

    Publication Year: 1998, Page(s):122 - 131
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (162 KB)

    Temporal database systems support all functions related to the management of large amounts of constantly changing data. However, current temporal database systems support a flat view of the history of data changes, in that all the changes are considered equally relevant and are, therefore, all stored in the database. However, many applications, such as monitoring and planning applications, call fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ockhamistic logics and true futures of counterfactual moments

    Publication Year: 1998, Page(s):132 - 139
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (94 KB)

    Various Ockhamistic logics are compared, with the aim of making clear the role of true futures of counterfactual moments, i.e. true futures of moments outside the true chronicle. First, we give an account of A.N. Prior's (1967) original Ockhamistic semantics, where the truth of a formula is relative to a moment and a chronicle. We prove that this is equivalent to a semantics put forward by Thomaso... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a formal characterization of temporal repetition with closed time

    Publication Year: 1998, Page(s):140 - 147
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    Proposes a novel approach to formally characterize temporal repetition. This differs from what has appeared so far in the AI/temporal reasoning literature, where time and particularly temporal repetition are represented within a linear structure. We propose to model temporal objects representing repetition with a closed time structure. Based on convex intervals and J.F. Allen's (1983) convex relat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing and learning temporal relationships among experimental variables

    Publication Year: 1998, Page(s):148 - 155
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (73 KB)

    The authors describe the necessity to capture temporal information in scientific experiment design for analysis by machine learning algorithms that can learn useful temporal patterns among experimental variables. They have identified three types of temporal information, namely duration, rate of change, and sequence of application of laboratory operators that are useful to learn from experimental d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient temporal propagation algorithm for scheduling

    Publication Year: 1998, Page(s):156 - 161
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Scheduling plays a major role in improving the productivity of many workplaces by minimizing the overall turnaround time and maximizing the resources. An iterative scheduler starts with an unfeasible schedule that satisfies only the temporal constraints and then it iteratively repairs other constraint violations, such as resource or state. After repairing each resource or state violation, the netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization method of time expressions using starting/ending point plane

    Publication Year: 1998, Page(s):162 - 168
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (119 KB)

    The authors propose a method that visualizes the time transitions in written time expressions in order to analyze how the author used them. The method represents time expressions as points on a plane and connects them with lines. They apply the method to an adventure story and a company history and discover two characteristics. First, during the progression of the text, the durations implied by th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time, communication and synchronisation in an agent-based programming language

    Publication Year: 1998, Page(s):169 - 176
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (77 KB)

    The author describes an approach to the representation, specification and implementation of multi-agent real-time systems. The approach is based on the notion of concurrent object-oriented systems where processes are represented as objects. This is a highly suitable base for extension to distributed AI and multi-agent application platforms. In his approach, the behaviour of an agent (its safety, p... View full abstract»

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