Two Logical Theories of Plan Recognition

W. Wobcke
2002 Journal of Logic and Computation  
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level plans from a set of descriptions of observed, typically low-level, actions. Kautz's approach is based on a formalization of the structural information contained in an abstraction/decomposition hierarchy of plan schemas: the inferred plans are selected by an observer agent from amongst those that can be generated from this
more » ... rated from this hierarchy. In this paper, we present two logics for plan recognition. The first theory, like Kautz's, is monotonic, meaning that all possible plans compatible with the observations are treated as equally plausible by the observer. The second theory is based on rejecting this simplifying assumption, and is nonmonotonic. To develop this theory, we adapt ideas from belief revision and conditional logic to define plan recognition inference as a nonmonotonic consequence operation based on an observer's plausibility ordering on the possible plans. The logics incorporate a sound and complete theory of temporal intervals based on Allen's approach, enabling the plan recognition agent to handle temporal information relating multiple observations. An underlying motivation for our work is to provide an intuitive semantic interpretation of plans using situation semantics and to interpret plan recognition as inference over courses of events. As shown by Allen [3], the constraint propagation algorithm is incomplete. However, Ladkin and Maddux [32], in work cited in Ladkin [31] , claim that Allen's logic is complete
doi:10.1093/logcom/12.3.371 fatcat:a7xg4aawu5el5msu2kgscxhtau