🚀 go-pugleaf

          The University of Western Ontario
            Department of Computer Science

                    COLLOQUIUM

Speaker: David Rosenblueth
         Department of Computer Science
         UNAM, Mexico D.F., Mexico.
Title:   Magic sets with charts
Time:    Wednesday, November 18 1992, at 2:00pm
Place:   MC 320
Abstract:
   Logic programs look like context-free grammars.  This makes proof
   procedures for logic programs resemble parsers for context-free
   grammars.  We exploit this resemblance to show that a well-known proof
   procedure for logic programs, called the ``magic-sets'' method, follows
   essentially the same principle as Earley's parser.  Earley's parser
   builds parse trees in a top-down manner.  There exist parsers similar
   to Earley's, that build parse trees in a bottom-up way.  This suggests
   using a bottom-up version of Earley's parser to devise a new proof
   procedure for logic programs.  We have developed one such procedure,
   which is an alternative to the magic-sets method.