Because you can play very clever tricks with DFS to make it efficient, time and space.<br><br><div><span class="gmail_quote">On 9/5/07, <b class="gmail_sendername">Stefan O'Rear</b> <<a href="mailto:stefanor@cox.net">
stefanor@cox.net</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">On Wed, Sep 05, 2007 at 01:21:52PM +1000, Thomas Conway wrote:
<br>> but to interpret this as a *program* you have to consider how it will<br>> be executed. In particular, using SLD resolution, conjunction (/\, or<br>> ',' in Prolog notation) is not commutative as it is in predicate
<br>> logic.<br><br>I've always wondered why Prolog uses DFS, instead of some complete<br>method like DFID or Eppstein's hybrid BFS... having to worry about<br>clause order seems so out of place.<br><br>Stefan
<br><br>-----BEGIN PGP SIGNATURE-----<br>Version: GnuPG v1.4.6 (GNU/Linux)<br><br>iD8DBQFG3iVMFBz7OZ2P+dIRAig8AJ9Er4Jeur+0VWTS4D026xKlsUOU3gCfVm/t<br>BUBNEE4JPBommIYetPL3knw=<br>=9JL7<br>-----END PGP SIGNATURE-----<br><br>
_______________________________________________<br>Haskell-Cafe mailing list<br><a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe">http://www.haskell.org/mailman/listinfo/haskell-cafe
</a><br><br></blockquote></div><br>