Domain-independent planning: representation and plan generation
Artificial Intelligence
Readings in natural language processing
Readings in natural language processing
A formal theory of plan recognition
A formal theory of plan recognition
Plan recognition for intelligent interfaces
Proceedings of the sixth conference on Artificial intelligence applications
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Computational Complexity and Natural Language
Computational Complexity and Natural Language
A model of plan inference that distinguishes between the beliefs of actors and observers
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Linguistic coherence: a plan-based alternative
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Activity Recognition for Dynamic Multi-Agent Teams
ACM Transactions on Intelligent Systems and Technology (TIST)
Plan recognition in exploratory domains
Artificial Intelligence
A new model of plan recognition
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Accounting for context in plan recognition, with application to traffic monitoring
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Flexible goal recognition via graph construction and analysis
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Efficient context free parsing of multi-agent activities for team and plan recognition
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 0.00 |
This paper is concerned with making precise the notion that recognizing plans is much like parsing text. To this end, it establishes a correspondence between Kautz' plan recognition formalism and existing grammatical frameworks. This mapping helps isolate subsets of Kautz' formalism in which plan recognition can be efficiently performed by parsing.