Beyond Question-Answering.
By Philip R. Cohen, C. Raymond Perrault, James F. Allen. 1981
Subfields: Natural Language Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Natural Language Processing
- Siva Reddy
- Danqi Chen
- Luke S. Zettlemoyer
- Christopher D. Manning
- Mohit Bansal
- Percy Liang
- Wen-tau Yih
- Jonathan Berant
Citations in the corpus
- CoQA: A Conversational Question Answering Challenge (2018, background): “Due to the conversational nature of questions and answers, our work can also be defined as an instantiation of a dialog problem (Weizenbaum, 1966; Cohen et al., 1982; Young et al., 2013; Serban et al., 2018).”
- Machine Theory of Mind (2018, background): “In this respect, the pursuit of a Machine ToM is about building the missing interface between machines and human expectations (Cohen et al., 1981).”
- Techniques for Plan Recognition (2001, background): “But might an agent attempt to perform actions that will aid or hinder the recognition of his plan? The former situation has been actively studied in language understanding, where the system (in order to respond appropriately to a speaker's utterances) must recognize the plan that the speaker intends”
- Plan Recognition as Planning (2009, background): “Plan recognition is an ubiquitous task in a number of areas, including natural language, multi-agent systems, and assisted cognition [Schmidt et al. , 1978; Cohen et al. , 1981; Pentney et al. , 2006 ] .”
- Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners (2010, background): “The need to recognize the goals and plans of an agent from observations of his behavior arises in a number of tasks including natural language, multi-agent systems, and assisted cognition (Cohen, Perrault, and Allen 1981; Pentney et al. 2006; Yang 2009).”
- Autonomous agents modelling other agents: A comprehensive survey and open problems (2017, methodology): “Plan recognition methods are sometimes categorised into “keyhole” and “intended” methods [79].”