Terminological Reasoning with Constraint Networks and an Application to Plan Recognition (1992)
| Citations: | 61 - 5 self |
BibTeX
@MISC{Weida92terminologicalreasoning,
author = {Robert Weida and Diane Litman},
title = {Terminological Reasoning with Constraint Networks and an Application to Plan Recognition},
year = {1992}
}
OpenURL
Abstract
Terminological systems, such as KL-ONE and K-Rep, are widely used in AI to represent and reason with concept descriptions. They compute subsumption relations between concepts and automatically classify concepts into a taxonomy. Each concept in the taxonomy describes a set of possible instances which are a superset of those described by its descendants. One limitation of current systems is their inability to handle complex compositions of concepts, such as constraint networks where each node is described by an associated concept. For example, plans are often represented (in part) as collections of actions related by a rich variety of temporal constraints. The T-REX system integrates terminological reasoning with constraint network reasoning to classify such plans, producing a "terminological" plan library. T-REX also introduces a new view of plan recognition as a process which dynamically partitions the plan library by modalities, e.g., necessary, possible and impo...







