🚀 go-pugleaf

>About cuts and assert, I will only say that competent Prolog programmers
>know that the fewer of them they use, the faster their programs are likely
>to be.

I agree with this statement but think it is dangerously misleading with respect
to the use of cut.  The most serious efficiency problem that people have with
Prolog is that they fail to make logically determinate predicates actually
determinate.  If the Prolog implementation isn't able to spot the determinacy
it has to keep backtracking information around indefinitely, which can waste
arbitrary amounts of space.  The simplest way to correct this is to add cuts at
all appropriate places.  Richard's point is that by careful design of your data
structures and your program you can very often get all or most of your
determinacy by exploiting first-argument-indexing, avoiding the need for cuts
and ending up with a more efficient and more understandable program.  He does
not mean that you should simply leave out cuts to get speed.

The text books that I have looked at do not explain this at all well.