Generalizing Explanation Structures

The generalization algorithm given in Chapter 2 is not sufficient for all types of generalization. The EGGS algorithm and the similar EBG algorithm [1] are not capable of significantly altering the structure of the explanation. Nonetheless, such structural alteration is a distinguishing and crucial step in several noteworthy types of generalization. Of the three types of structural generalization discussed in Chapter 1 — disjunctive augmentation, temporal generalization, and number generalization — our research addresses aspects of the latter two. Disjunctive augmentation, while important, is judged not to be as crucial or as challenging as the other two. If the EBL approach cannot overcome the demands of temporal and number generalization, the system profits little from disjunctive augmentation.

[1]  Alan W. Biermann,et al.  The Inference of Regular LISP Programs from Examples , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  William W. Cohen.  Generalizing Number and Learning from Multiple Examples in Explanation Based Learning , 1988, ML.

[3]  Paul S. Rosenbloom,et al.  Universal Subgoaling and Chunking , 1986 .

[4]  Peter M. Andreae.  Justified generalization: acquiring procedures from examples , 1984 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Rodney A. Brooks,et al.  An approach to automatic robot programming , 1986, CSC '86.

[7]  Jack Mostow,et al.  PROLEARN: Towards a Prolog Interpreter that Learns , 1987, AAAI.

[8]  Richard Fikes,et al.  Deductive Retrieval Mechanisms for State Description Models , 1975, IJCAI.

[9]  Daniel S. Weld.  The Use of Aggregation in Causal Simulation , 1986, Artif. Intell..

[10]  R. M. Keller,et al.  The role of explicit contextual knowledge in learning concepts to improve performance , 1987 .

[11]  Phillip D. Summers,et al.  A Methodology for LISP Program Construction from Examples , 1977, J. ACM.

[12]  Gerald J. Sussman,et al.  A Computational Model of Skill Acquisition , 1973 .

[13]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[14]  Thomas Ellman,et al.  Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness , 1985, IJCAI.

[15]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[16]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[17]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[18]  B. Whitehall.  Substructure Discovery in Executed Action Sequences , 1987 .

[19]  Laurent Siklóssy,et al.  Automatic Program Synthesis from Example Problems , 1975, IJCAI.

[20]  J. Gerard Wolff,et al.  Language acquisition, data compression and generalization , 1982 .

[21]  Steven Minton,et al.  Selectively Generalizing Plans for Problem-Solving , 1985, IJCAI.

[22]  Gerald DeJong,et al.  The Classification, Detection and Handling of Imperfect Theory Problems , 1987, IJCAI.

[23]  Yoshinori Suganuma,et al.  Learning Structures of Visual Patterns from Single Instances , 1991, Artif. Intell..

[24]  Gerald DeJong,et al.  Schema Acquisition from One Example: Psychological Evidence for Explanation-Based Learning. , 1987 .

[25]  Scott E. Fahlman,et al.  A Planning System for Robot Construction Tasks , 1973, Artif. Intell..

[26]  Oren Etzioni,et al.  Acquiring Effective Search Control Rules: Explanation-Based Learning in the PRODIGY System , 1987 .