🚀 go-pugleaf

In article <1992Oct5.102142.16636@ecrc.de> micha@ecrc.de writes:
>In article 28120@athena.cs.uga.edu, mcovingt@aisun3.ai.uga.edu (Michael Covington) writes:
>>  - Efficiency of execution
>>       (That's right, if you're using backtracking and unification then
>>        your program will probably run as fast under Prolog as under any
>>        other language.  We once ported a simple Prolog list processing
>>        routine into Pascal as a test, and got a factor-of-14 *slowdown*!)
>
>It is nice that People really do believe in Prolog, but there must be a mistake here.
>The fact that you use unification and backtracking does not make your program
>faster, it may simplify the algorithm, though. 

What I meant was that if the algorithm *needs* unification and backtracking,
then it will probably run as efficiently in Prolog as in any other language,
because Prolog implementors work hard on implementing unification and
backtracking efficiently.



-- 
:- Michael A. Covington     internet mcovingt@uga.cc.uga.edu 
:- Artificial Intelligence Programs       phone 706 542-0359
:- The University of Georgia                fax 706 542-0349
:- Athens, Georgia 30602 U.S.A.          amateur radio N4TMI