Explanation Based Learning as Constrained Search *
David Haines
Department of Computer and Information Science
University of Massachusetts
Amherst, Massachusetts, 01003
haines@cs.umass.edu
Introduction
EBL (Mitchell et a/., 1986; Dejong and Mooney, 1986) may not at first seem to be a search process;
there is no search for generalizations as we have them in hand in the proof tree. We may look through
these valid generalizations for the most useful ones, but we don't need to search for correct ones. However a
different view is this: EBL appears not to need to search for generalizations because it uses truth preserving
inference to trivializ ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.