Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!apple!ames!hc!lll-winken!csd4.milw.wisc.edu!uxc!uxc.cso.uiuc.edu!m.cs.uiuc.edu!s.cs.uiuc.edu!mccaugh
From: mccaugh@s.cs.uiuc.edu
Newsgroups: comp.lang.prolog
Subject: Re: Propositional Theorem Prover
Message-ID: <208500004@s.cs.uiuc.edu>
Date: 27 May 89 10:00:00 GMT
References: <1663@kulcs.kulcs.uucp>
Lines: 8
Nf-ID: #R:kulcs.kulcs.uucp:1663:s.cs.uiuc.edu:208500004:000:574
Nf-From: s.cs.uiuc.edu!mccaugh    May 27 05:00:00 1989


 Since the consensus is that Prolog is "less efficient" than C, why consider a
 program written in Prolog any more acceptable a solution than BubbleSort is,
 vs. QuickSort? From my experience in "software shops", I can assure you that
 efficiency is a fundamental issue. A more salient point to take up would
 seem to be: how long does it take a programmer to craft a solution in Prolog
 vs. one in C? Probably a lot less time (at the risk of belaboring the obvious)
 and if architectures ever evolve to the Japanese plans for the 5th Generation,  then whither efficiency?