Hi Ali:

Please can you track down the Master's thesis of Peter Wood's student
and present it in the seminar?
This correspondence is collected in:

http://www.ccs.neu.edu/research/demeter/related-work/toronto

The Mendelzon papers are at: 

www.cs.toronto.edu/~mendel/papers.html under "Visualization"

-- Karl
===============================
From mendel@cs.toronto.edu Wed Feb 25 10:54:00 1998

Hi Karl,

> 
> What I am struggling with now is how to evaluate a GraphLog query.
> I read your Theoretical Computer Science paper: Low Complexity Aggregation
> in GraphLog and Datalog. It describes how this is done by referring
> to Datalog work. I was wondering whether you know of a nice, self-contained
> description of this algorithm in graph theoretic terms without referring
> to many pages of Datalog material in Jeff's book.

Actually, a student of Peter Wood's at the University of Capetown
did exactly that for his Master's thesis. I don't think I have it
online; you could ask Peter at  ptw@cs.uct.ac.za (the address is obsolete,
he has moved to King's College, but I hope it's forwarded).

> Is there an 
> implementation of GraphLog available?
> 

Yes, it's called Hy+, there are 2 problems with it: (1)it's written in
VisualWorks Smalltalk and requires a licence to run it, and (2) it's not
maintained and hasn't been used for a while. But if you can solve (1),
you can have it.

> Also, do you know of teaching material (viewgraphs) explaining GraphLog.
> 
There's a set of overview slides in
ftp://ftp.db.toronto.edu/pub/papers/bnr.ps.gz.

I'll see if I can find some more detailed ones on GraphLog.

I also have a 15-min videotape I can send you.

Best,
-alberto.
> Best regards,
> -- Karl
> PS. Demeter viewgraphs are in: 
> http://www.ccs.neu.edu/research/demeter/course/f97/lectures/
> 
> 
> 
> 
>