Generic plan recognition for dialogue systems

作者: George Ferguson , James F. Allen

DOI: 10.3115/1075671.1075709

关键词:

摘要: We describe a general framework for encoding rich domain models and sophisticated plan reasoning capabilities. The approach uses graph-based to address wide range of tasks that typically arise in dialogue systems. graphical representation is independent but connected the underlying action time. types recognition are needed, illustrating these with examples from dialogues collected as part TRAINS project. algorithms presented, issues formalization processes discussed.

参考文章(11)
Diane J. Litman, Robert A. Weida, Terminological Reasoning with Constraint Networks and an Application to Plan Recognition. principles of knowledge representation and reasoning. pp. 282- 293 ,(1992)
Barbara Di Eugenio, Bonnie Webber, PLAN RECOGNITION IN UNDERSTANDING INSTRUCTIONS Artificial Intelligence Planning Systems. pp. 52- 61 ,(1992) , 10.1016/B978-0-08-049944-4.50012-4
James F. Allen, Temporal reasoning and planning Reasoning about plans. pp. 1- 67 ,(1991) , 10.1016/B978-1-55860-137-6.50007-8
J. F. Allen, L. K. Schubert, The TRAINS Project Defense Technical Information Center. ,(1991) , 10.21236/ADA247447
H. A. Kautz, A formal theory of plan recognition University of Rochester. ,(1987)
Alvin Ira Goldman, Theory of Human Action ,(1970)