Here is a paper on how to do logic programming in Haskell
Deals with a logic puzzle and how the haskell and prolog solutions compare
http://web.engr.oregonstate.edu/~erwig/zurg/
In terms of automated theorem proving here is another paper
http://citeseer.ist.psu.edu/cache/papers/cs/5363/http:zSzzSzwww.ki.informati...
Regards
David
On 26/09/06, Pasqualino 'Titto' Assini
-----Original Message----- From: haskell-cafe-bounces@haskell.org [mailto:haskell-cafe- bounces@haskell.org] On Behalf Of Christoph Herrmann Sent: 25 September 2006 21:22 To: Max Vasin Cc: haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] Re: Is Haskell a 5GL? ...
What Prolog really provides concerning automatic problem solving is little: equation solving in term algebra; you can simulate that in Haskell without much effort.
Could you, or anyone else, elaborate a bit on how to emulate Prolog in Haskell?
For example, I remember that in Prolog you can write a concat function that can be used to concatenate two lists as well as to split them:
concat([1,2] ,[3,4] ,Z) --> Z = [1,2,3,4] concat([1,2] ,Y ,[1,2,3,4]) --> Y = [3,4]
Now, that's powerful. How would you do that in Haskell?
Regards,
Titto
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- It chews up lies and spits out the gristle of truth http://liveatthewitchtrials.blogeasy.com/