Problems in formal temporal reasoning

doi:10.1016/0004-3702(88)90078-1

Artificial Intelligence

Volume 36, Issue 1, August 1988, Pages 49-61

https://doi.org/10.1016/0004-3702(88)90078-1 Get rights and content

Abstract

Ever since its introduction by McCarthy and Hayes in 1969, the so-called frame problem has been the object of much fascination and debate. Although it was defined in the narrow context of the situation calculus, a specific temporal formalism, it was clear from the start that it is in fact a manifestation of some fundamental problem in temporal reasoning.

Our aim in this informal paper is to identify the general form of certain classes of problems that arise in formal temporal reasoning. We argue that problems such as the frame problem arise from the conflicting desires to reason both rigorously and efficiently about the future. This conflict does not depend on the particular underlying temporal formalism. In particular, we identify two formalism-independent problems, called the qualification problem and the extended prediction problem, which subsume the frame problem. To illustrate the fact that these problems are indeed inherent to the prediction task and not to a particular formalism, we show that they arise in two distinct frameworks: classical mechanics, and Hayes' histories notation.

References (7)

D.V. McDermott
A temporal logic for reasoning about processes and plans
Cognitive Sci.
(1982)
R. Montague
Deterministic theories
Artificial Intelligence
(1984)

There are more references available in the full text version of this article.

Cited by (42)

Temporal similarity by measuring possibilistic uncertainty in CBR
2009, Fuzzy Sets and Systems
Similarity is an essential concept in case-based reasoning (CBR). In domains in which time plays a relevant role, CBR systems require good temporal similarity measures to compare cases. Temporal cases are traditionally represented by a set of temporal features, defining time series and temporal event sequences. In the particular situation where these features are not homogeneous (i.e. combination of qualitative and quantitative information), systems find difficulties in performing the CBR cycle. Furthermore, temporal similarity measures cannot directly apply the efficient time series techniques, requiring new approaches to deal with these heterogeneous sequences. To this end, recent proposals are focused on direct matching between pairs of features within sequences, mainly based on classical distances. However, three limitations to the traditional approaches have been identified: (1) they do not consider the implicit temporal relations amongst all features of the sequence (ignoring a large amount of temporal information); (2) they ignore the uncertainty produced in any process of analogy; (3) they are designed to compare pairs of sequences, limiting their use to basic aspects of the Retrieval step of CBR (no benefits on other CBR steps). Temporal constraint networks have proved to be useful tools for temporal representation and reasoning, and can be easily extended to manage imprecision and uncertainty. An approach to solve similarity problems could be the transformation of these heterogeneous sequences into uncertain temporal relations, obtaining a temporal constraint network. The overall uncertainty of this network can be considered as an effective indicator of the sequences similarity. Therefore, this paper proposes a non-classical approach to measure temporal similarity of cases which are heterogeneous temporal event sequences. Given two or more sequences, the temporal similarity is measured by describing a unique temporal scenario of possibilistic temporal relations and calculating the uncertainty produced.
Reasoning in dynamic systems: From raw data to temporal abstract information
2009, Neurocomputing
Understanding the behaviour of systems requires dealing with the raw data obtained from variables that define the system's state and using high-level knowledge for deep processing tasks. Therefore, intermediate processes to reduce this cognitive gap are needed. Besides, when dealing with dynamic systems, in which state variables evolves with time, the way in which time is perceived plays a crucial role and affects the performance of deep processing tasks. Such an intermediate process, which helps overcome this cognitive gap between raw data and deep knowledge processing levels, while taking into account the time dimension, is called temporal abstraction (TA). The final objective of TA is to provide an explanation that describes the behaviour of dynamic systems arising from the temporal evolution of state variables and to locate the data in their correct temporal context. In this article we propose a novel method for TA, based on an abductive strategy and a temporal constraint model as an underlying formalism for time representation and reasoning. The abductive vision of this problem is suitable for a general case in which data are heterogeneous and where there is temporal imprecision.
Computing context-dependent temporal diagnosis in complex domains
2008, Expert Systems with Applications
Citation Excerpt :
Depending on which kind of temporal entity is used, different kinds of quantitative temporal relations can be defined, thus describing different algebras. The point algebra (Shoham & McDermott, 1988) assumes as a unique primitive the temporal points and the relations amongst them (Vilain & Kautz, 1986). One of the interval proposals most referred to is the algebra proposed by Allen (1983), which states intervals as primitives.
Over the years, many Artificial Intelligence (AI) approaches have dealt with the diagnosis problem and its application in complex environments such as medical domains. Model-Based Reasoning (MBR) is one of the approaches that traditionally have tried to solve this problem thanks to its capacity for modelling and reasoning. The consideration of the temporal dimension in these domains is a challenging topic in MBR, especially if temporal imprecision is taken into account. Unfortunately, despite there being many successful MBR systems, there are still two fundamental problems in their development at the aforementioned domains: (1) the degree of dependency between the model used and the domain; and (2) the reutilization of the systems when the domain changes.
First this paper proposes a set of basic requirements for the design of Knowledge-Based Systems that will help to solve the problem of temporal diagnosis for environments of high conceptual complexity. From these principles and through a deep analysis of the various approaches present in AI we establish a generic framework that addresses both goals by integrating MBR and ontologies for domain knowledge representation in order to describe a intermediate model representation to facilitate the low dependency between the model and the application domain.
Finally, this paper demonstrates the use of the framework by developing a diagnosis system within a real medical environment (Intensive Care Unit) with a step-by-step description of the process, from the architecture through to implementation.
Chapter 20 Time in qualitative simulation
2005, Foundations of Artificial Intelligence
Temporal query of attribute-value patient data: Utilizing the constraints of clinical studies
2003, International Journal of Medical Informatics
We describe an interface and architecture for ad hoc temporal query of TrialDB, a clinical study data management system (CSDMS). A clinical study focuses primarily on the effect of therapy on a group of patients, who have individually enrolled in a study at different times. Relative times (chronological offsets from the time of enrollment) are therefore more useful than absolute times when collectively describing therapeutic or adverse events. For logistic reasons, study parameter values are typically recorded at fixed relative times (‘study events’), which serve as time-stamps and can be used by CSDMS temporal query algorithms to simplify temporal computations. The entity-attribute-value model of clinical data storage, used by both CSDMSs and clinical patient record systems, complicates temporal query. To apply temporal operators, data for parameters of interest must first be transiently converted into conventional relational form, with one column per parameter.
Temporal representation and reasoning in artificial intelligence: A review
2001, Mathematical and Computer Modelling
The explicit representation and reasoning about time is an important problem in many areas of artificial intelligence. Over the last 10–15 years, it has been attracting the attention of many researchers. Several temporal reasoning systems, differing in design issues related to ontology of time, underlying temporal logic, temporal constraints used and algorithms employed, have been developed. In this survey, important representational issues which determine a temporal reasoning system are introduced. In particular, several important notions like change, causality, actions are described in terms of time. For each issue different choices available in the literature are discussed. The most influential approaches to temporal reasoning in artificial intelligence are analyzed in terms of these major representational issues.

View all citing articles on Scopus

View full text

Problems in formal temporal reasoning

Abstract

Cognitive Sci.

Artificial Intelligence