A Problem-Solving Architecture for Managing Temporal Data and Their Abstractions

From Tetherless World Wiki

Jump to: navigation, search

Citation: Yuval Shahar and Samson W. Tu and Amar K. Das and Mark A. Musen. (1992) A Problem-Solving Architecture for Managing Temporal Data and Their Abstractions. In , 1992.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Yuval Shahar and Samson W. Tu and Amar K. Das and Mark A. Musen
title A Problem-Solving Architecture for Managing Temporal Data and Their Abstractions
number KSL-92-22
institution AAAI
address San Jose, CA
year 1992
Bibtex more
Access Paper
abstract [[abstract::Representing and reasoning about temporal information are of interest in artificial intelligence. The most prominent research in this area has been formal. The wealth of competing formalisms [Shoham, 1987; Allen, 1984; Bacchus et al., 1981] provides a number of choices for designing a model of time and for representing and reasoning about temporal intervals; temporal positions can be reified or nonreified; and temporal reasoning can involve the scope of first-order predicate logic or can be restricted to the Horn clauses of a PROLOG-like system. When we implement a knowledge-based system that uses temporal representation and temporal reasoning, the functionalities of the application and the nature of domain information must suggest the appropriate temporal model. In this paper, we present a class of applications and an implementation strategy for temporal reasoning that is appropriate for that class. Our application involves a reactive planning system in the domain of medical therapy. As in many complex real-life domains, the physiological processes that medical therapy seeks to control are too complex to be modeled completely. Instead, medical experts start with a standard plan for solving a class of problems, and then use domain-specific heuristics to modify the standard plan in response to information gathered during plan execution. This type of planning relies on the planner specializing and instantiating a skeletal plan that specifies procedures of actions that are known to be effective in similar cases. The system assumes the interleaving of generation and execution of plan steps. The system initially follows the procedures specified in the standard skeletal plan, and, as the plan is executed, modifies the standard plan periodically in reponse to the observed patient reactions to the earlier actions. We call this problem-solving method episodic skeletal-plan refinement (ESPR) [Tu et al., 1987].|Representing and reasoning about temporal information are of interest in artificial intelligence. The most prominent research in this area has been formal. The wealth of competing formalisms [Shoham, 1987; Allen, 1984; Bacchus et al., 1981] provides a number of choices for designing a model of time and for representing and reasoning about temporal intervals; temporal positions can be reified or nonreified; and temporal reasoning can involve the scope of first-order predicate logic or can be restricted to the Horn clauses of a PROLOG-like system. When we implement a knowledge-based system that uses temporal representation and temporal reasoning, the functionalities of the application and the nature of domain information must suggest the appropriate temporal model. In this paper, we present a class of applications and an implementation strategy for temporal reasoning that is appropriate for that class. Our application involves a reactive planning system in the domain of medical therapy. As in many complex real-life domains, the physiological processes that medical therapy seeks to control are too complex to be modeled completely. Instead, medical experts start with a standard plan for solving a class of problems, and then use domain-specific heuristics to modify the standard plan in response to information gathered during plan execution. This type of planning relies on the planner specializing and instantiating a skeletal plan that specifies procedures of actions that are known to be effective in similar cases. The system assumes the interleaving of generation and execution of plan steps. The system initially follows the procedures specified in the standard skeletal plan, and, as the plan is executed, modifies the standard plan periodically in reponse to the observed patient reactions to the earlier actions. We call this problem-solving method episodic skeletal-plan refinement (ESPR) [Tu et al., 1987].]]

KSL Technical Report ID: KSL-92-22
Facts about A Problem-Solving Architecture for Managing Temporal Data and Their AbstractionsRDF feed
Address San Jose, CA  +
Author Yuval Shahar and Samson W. Tu and Amar K. Das and Mark A. Musen  +
Bibtype techreport  +
Has author Yuval Shahar and Samson W. Tu and Amar K. Das and Mark A. Musen  +
Has identifier KSL-92-22  +
Has publishing details 1992  +
Has title A Problem-Solving Architecture for Managing Temporal Data and Their Abstractions  +
Has year 1992  +
Institution AAAI  +
Ksl tr id KSL-92-22  +
Number KSL-92-22  +
Process note NO  +
Title A Problem-Solving Architecture for Managing Temporal Data and Their Abstractions  +
Year 1992  +
Retrieved from "http://tw.rpi.edu/wiki/A_Problem-Solving_Architecture_for_Managing_Temporal_Data_and_Their_Abstractions"
Personal tools