A formal theory of plan recognition and its implementation
Reasoning about plans
The syntactic process
Plan Recognition in Natural Language Dialogue
Plan Recognition in Natural Language Dialogue
Probabilistic State-Dependent Grammars for Plan Recognition
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Assessing the complexity of plan recognition
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Policy recognition in the abstract hidden Markov model
Journal of Artificial Intelligence Research
Fast and complete symbolic plan recognition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Domain Independent Goal Recognition
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
| Hi-index | 0.00 |
This paper presents a new algorithm for plan recognition called ELEXIR (Engine for LEXicalized Intent Recognition). ELEXIR represents the plans to be recognized with a grammatical formalism called Combinatory Categorial Grammar(CCG). We show that representing plans with CCGs can allow us to prevent early commitment to plan goals and thereby reduce runtime.