Abstract
By its very nature, artificial intelligence is concerned with investigating topics that are ill-defined and ill-understood. This paper describes two approaches to expanding a good but incomplete theory of a domain. The first uses the domain theory as far as possible and fills in specific gaps in the reasoning process, generalizing the suggested missing steps and adding them to the domain theory. The second takes existing operators of the domain theory and applies perturbations to form new plausible operators for the theory. The specific domain to which these techniques have been applied is high-school algebra problems. The domain theory is represented as operators corresponding to algebraic manipulations, and the problem of expanding the domain theory becomes one of discovering new algebraic operators. The general framework used is one of generate and test—generating new operators for the domain and using tests to filter out unreasonable ones. The paper compares two algorithms, INFER and MALGEN, examining their performance on actual data collected in two Scottish schools and concluding with a critical discussion of the two methods.
Article PDF
Similar content being viewed by others
References
Bennett, J.S, & Dietterich, T.G. 1986. The test incorporation hypothesis and the weak methods (Technical Memo TR-86-30-4). Corvallis: Oregon State University, Computer Science Department.
Brown, J.S., & Burton, R. (1978). Diagnostic models for procedural bugs in basic mathematical skills. Cognitive Science, 2, 155-198.
Buchanan, B.G., & Feigenbaum, E.A. (1978). DENDRAL and Meta-DENDRAL: Their application dimensions. Artificial Intelligence, 11, 5-24.
Carbonell, J.G. (1986). Analogy in problem solving. In R.S. Michalski, J.G. Carbonell, & T.M. Mitchell (Eds.), Machine learning: An artificial intelligence approach (Vol.2). San Mateo, CA: Morgan Kaufmann.
Carr, B., & Goldstein, I. (1977). Overlays: A theory of modeling for computer aided instruction (AI Memo 406). Cambridge, MA: Massachusetts Institute of Technology, Laboratory for Artificial Intelligence.
Chisholm, I.H., & Sleeman, D.H. (1979). An aide for theory formation. In D. Michie (Ed.), Expert systems in the microelectronic age. Edinburgh: EUP.
Davis, R. (1979). Applications of meta-level knowledge to the construction, maintenance and use of large knowledge bases. In R. Davis & D. Lenats (Eds.), Knowledge-based systems in artificial intelligence. New York: McGraw-Hill.
Hall, R. (1988). Learning by failing to explain: Using partial explanations to learn in incomplete or intractable domains. Machine Learning, 3, 45-77.
Hirsh, H. (1985). Modeling problem-solving performance. Master's Thesis, Computer Science Department, Stanford University, Palo Alto, CA.
Iba, G.A. (1985). Learning by discovering macros in puzzle solving. Proceedings of the Ninth International Joint Conference in Artificial Intelligence (pp.640-642). Los Angeles, CA: Morgan Kaufmann.
Iba, G.A. (1989). A heuristic approach to the discovery of macro-operators. Machine Learning, 3, 285-317.
Langley, P., & Ohlsson, S. (1984). Automated cognitive modeling. Proceedings of the Fourth National Conference on Artificial Intelligence (pp.193-197). Austin, TX: Morgan Kaufmann.
Larson, J.B., & Michalski, R.S. (1977). Inductive inference of VL decision rules. SIGART Newsletter, 63, 38-44.
Lenat, D.B. (1983). The role of heuristics in learning by discovery: Three case studies. In R.S. Michalski, J.G. Carbonell, & T.M. Mitchell (Eds.), Machine learning: An artificial intelligence approach. San Mateo, CA: Morgan Kaufmann.
McCarthy, J. (1980). Circumscription —A form of non-monotonic reasoning. Artificial Intelligence, 13, 27-39.
Minsky, M. (1975). A framework for representing knowledge. In PH. Winston (Ed.), The psychology of computer vision. New York: McGraw-Hill.
Minton, S. (1985). Selectively generalizing plans for problem-solving. Proceedings of the Ninth International Joint Conference in Artificial Intelligence (pp.596-599). Los Angeles, CA: Morgan Kaufmann.
Neves, D.M. (1978). A computer program that learns algebraic procedures by examining examples and working problems in a textbook. Proceedings of the 2nd National Conference of the Canadian Society for Computational Studies of Intelligence. Toronto, Canada.
Quinlan, J.R. (1986). Induction of decision trees. Machine Learning, 1, 81-106.
Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13, 81-132.
Sleeman, D.H. (1982). Inferring (mal)rules from pupil's protocols. Proceedings of the 1982 European AI Conference (pp.160-164). Orsay, France.
Sleeman, D.H. (1983). A rule directed modeling system. In R.S. Michalski, J.G. Carbonell, & T.M. Mitchell (Eds.), Machine learning: An artificial intelligence approach. San Mateo, CA: Morgan Kaufmann.
Sleeman, D.H. (1984). An attempt to understand students'understanding of basic algebra. Cognitive Science, 8, 387-412.
Sleeman, D.H. (1985). Basic algebra revisited: A study with 14 year olds. International Journal of Man-Machine Studies, 22, 127-149.
Sleeman, D.H. (1987). Some challenges for intelligent tutoring systems. Proceedings of the Tenth International Joint Conference on Artificial Intelligence (pp.1166-1168). Milan, Italy: Morgan Kaufmann.
Sleeman, D.H., & Ellery, I. (1988). A catalogue of mal-rules generated by INFER* (Technical Report). Aberdeen, Scotland: University of Aberdeen, Computing Science Department.
Sleeman, D.H., & Smith, M.J. (1981). Modeling students'problem solving. Artificial Intelligence, 16, 171-187.
VanLehn, K. (1987) Learning one subprocedure per lesson. Artificial Intelligence, 31, 1-40.
Wilkins, D.C. (1987). Apprenticeship learning techniques for knowledge-based systems. Doctoral dissertation, University of Michigan, Ann Arbor, MI.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sleeman, D., Hirsh, H., Ellery, I. et al. Extending Domain Theories: Two Case Studies in Student Modeling. Machine Learning 5, 11–37 (1990). https://doi.org/10.1023/A:1022607624441
Issue Date:
DOI: https://doi.org/10.1023/A:1022607624441