Machine learning under felicity conditions: exploiting pedagogical behavior

  • John D. Lewis
  • Bruce A. MacDonald
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

In task instruction a knowledgeable and well-intentioned teacher will provide focusing information, highlight decision points, indicate structure, and so forth. Recognition of these communicative acts is critical for practical learning. This paper describes an extension to explanation-based learning that augments domain knowledge with knowledge of constraints on the structure of instructional discourse. VanLehn’s felicity conditions have formalized some of the constraints guiding a teacher during the presentation of examples. In this paper we weaken his condition that each lesson be an optimal set of examples, instead assuming that the teacher provides an explanation. Instruction is viewed as planned explanation, and plan recognition is applied to the problem at both domain and discourse levels, and extended to allow the learner to have incomplete knowledge. The model includes (a) a domain level plan recognizer and (b) a discourse level plan recognizer that cues (c) a third level of plan structure rewriting rules. Details are given of an example in which a robot apprentice is instructed in the building of arches. Tractable learning and instructability are our goals.

Keywords

Expense Arena Paral Clarification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, P. & Levesque, H. (1990). Rational interaction as the basis for communication. In P. Cohen, J. Morgan, & M. Pollack, (Eds.), Intentions in Communication (pp. 221–256). Cambridge, MA: MIT Press.Google Scholar
  2. Cohen, P., Perrault, R., & Allen, J. (1981). Beyond question-answering. (Technical Report 4644.) Cambridge, MA: BBN Inc.Google Scholar
  3. Coulthard, R. M. (1970). An Empirical Investigation of Restricted & Elaborated Codes. PhD thesis, University of Birmingham.Google Scholar
  4. Ernst, G. W. & Goldstein, M. M. (1982). Mechanical discovery of classes of problem solving strategies. Journal of the ACM, 29, 1–23.CrossRefMathSciNetMATHGoogle Scholar
  5. Fikes, R. E. (1972). Monitored execution of robot plans produced by STRIPS. In C.V. Freiman, (Eds.), Information Processing 71: Proceedings of the IFIP Congress 71, Vol. 1, Foundations and Systems, 23–28 August 1971, Ljubljana, Yugoslavia (pp. 189–194). Amsterdam, ND: North-Holland.Google Scholar
  6. Gold, E. M. (1967). Language identification in the limit. Information and Control, 10, 447–474.CrossRefMATHGoogle Scholar
  7. Grice, H. P. (1969). Utterer’s meaning and intentions. Philisophical Review, 68(2), 147–177.CrossRefGoogle Scholar
  8. Lewis, J. D. & MacDonald, B. A. (1992). Task learning from instruction: An application of discourse processing techniques to machine learning. Proceedings of Applications of AI X, 168–179.Google Scholar
  9. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2(4), 285–318.Google Scholar
  10. MacDonald, B. A. (1991). Instructable systems. Knowledge Acquisition, 3, 381–420.CrossRefGoogle Scholar
  11. Pollack, M. (1986). Inferring Domain Plans in Question Answering. PhD thesis, University of Pennsylvania.Google Scholar
  12. Rivest, R. & Sloan, R. (1988). Learning complicated concepts reliably and usefully. AAAI-88, Proceedings of the Seventh National Conference on Artificial Intelligence, St. Paul Minnesota. Volume 2, 635–640.Google Scholar
  13. Segre, A. M. (1988). Explanation-based learning of generalized robot assembly plans. Amsterdam, ND: Kluwer Academic Publishers. [Also Ph.D. thesis, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 1988].CrossRefGoogle Scholar
  14. Sinclair, J. M. & Coulthard, R. M. (1975). Towards an Analysis of Discourse: The English Used by Teachers and Pupils. Oxford: Oxford University Press.Google Scholar
  15. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134–1142.CrossRefMATHGoogle Scholar
  16. VanLehn, K. (1983). Felicity conditions for human skill acquisition: validating an AI-based theory. (Interim Report P8300048). Palo Alto, CA: XEROX Palo Alto Research Centers.Google Scholar
  17. VanLehn, K. (1987). Learning one subprocedure per lesson. Artificial Intelligence, 31(1), 1–40.CrossRefGoogle Scholar
  18. VanLehn, K. (1990). Mind Bugs: The Origins of Procedural Misconceptions. Cambridge, MA: MIT Press.Google Scholar
  19. VanLehn, K. (1991). Personal communication, October.Google Scholar

Copyright information

© British Computer Society 1993

Authors and Affiliations

  • John D. Lewis
    • 1
  • Bruce A. MacDonald
    • 1
  1. 1.Knowledge Sciences Inst., Computer Science Dept.The University of CalgaryCalgaryCanada

Personalised recommendations