Programming by demonstration
Tessa A. Lau, Daniel S. Weld · 1998
Although Programmingby Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-specific approaches to execution-trace generalization.In this paper we define two applicationindependent methods for performing generalization that are based on well-understood machine learning technology.TGENV~ uses version-space generalization, and TGENFOIL is based on the FOIL inductive logic programming algorithm.We analyze each method both theoretically and empirically, arguing that TGENVS has lower sample complexity, but TGENFOIL can learn a much more interesting class of programs.