🚀 go-pugleaf

I needed to do a breadth-first search in Prolog, so being the naturally lazy
person that I am, I started to look through some Prolog books to see if they
had an example program I could just copy.  I noticed that one author used 
lists to maintain which nodes still needed to be expanded, while another
author used assert/1 (and retract/1) to maintain those nodes.  Since I am
not into Prolog internals, I was wondering about the ramifications of the two
approaches.  Is one approach going to be, in general, faster than the other,
(my gut feeling is that the list approach would be faster, but...)?  Are there
occasions where dynamic assertions are the way to go?  Are there things that
you can do with assertions that you can't do with lists?

Thanks!

Jeff De Vries (jdevries@ads.com or jdevries@ads.arpa)
Advanced Decision Systems
Disclaimer: I am speaking for myself, and not ADS.