Because you can play very clever tricks with DFS to make it efficient, time and space.

On 9/5/07, Stefan O'Rear < stefanor@cox.net> wrote:
On Wed, Sep 05, 2007 at 01:21:52PM +1000, Thomas Conway wrote:
> but to interpret this as a *program* you have to consider how it will
> be executed. In particular, using SLD resolution, conjunction (/\, or
> ',' in Prolog notation) is not commutative as it is in predicate
> logic.

I've always wondered why Prolog uses DFS, instead of some complete
method like DFID or Eppstein's hybrid BFS...  having to worry about
clause order seems so out of place.

Stefan

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)

iD8DBQFG3iVMFBz7OZ2P+dIRAig8AJ9Er4Jeur+0VWTS4D026xKlsUOU3gCfVm/t
BUBNEE4JPBommIYetPL3knw=
=9JL7
-----END PGP SIGNATURE-----

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe