Article View: comp.lang.prolog
Article #4071Re: Propositional Theorem Prover
From: mccaugh
Date: Sat, 27 May 1989 10:00
Date: Sat, 27 May 1989 10:00
8 lines
1075 bytes
1075 bytes
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?
Technical Details
Message-ID:
<208500004@s.cs.uiuc.edu>Path:
arc1-ca.pugleaf.net!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!mccaughReferences:
<1663@kulcs.kulcs.uucp>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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