Extending Domain Theories: Two Case Studies in Student Modeling

  • Authors:
  • D. Sleeman;Haym Hirsh;Ian Ellery;In-Yung Kim

  • Affiliations:
  • Computing Science Department, King's College, The University of Aberdeen, Aberdeen AB9 2UB, Scotland, UK. SLEEMAN%CS.ABDN.AC.UK@NSFNET-RELAY.AC.UK;Knowledge Systems Laboratory, Computer Science Department, Stanford University, Palo Alto, CA 94304. Current Address: Computer Science Department, Rutgers University, Hill Center, Busch Cam ...;Computing Science Department, King's College, The University of Aberdeen, Aberdeen AB92UB, Scotland, UK. IE%CS.ABDN.AC.UK@NSFNET-RELAY.AC.UK;FMC AI Center, Central Engineering Laboratories, 1205 Coleman Avenue, Santa Clara, CA 95052. KIM@UNIXB.CEL.FMC.COM

  • Venue:
  • Machine Learning
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

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.