Using Lexicalized Grammars and Headedness for Approximate Plan Recognition

Christopher W Geib

This paper presents a new algorithm for plan recognition using an action grammar formalism based on Combinatory Catagorial Grammar, that requires a significant shift in thinking about the problem of plan recognition. This approach makes significant use of the concepts of lexicalization and headedness from natural language parsing. It argues that lexicalization of action grammars can help plan recognition address a number of technical and efficiency questions, and that headedness in action grammars is previously unrecognized and an important addition to plan recognition theory in its own right.

Subjects: 5. Common Sense Reasoning; 3.4 Probabilistic Reasoning

Submitted: May 15, 2007

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.