Peter Ilberg wrote:
> On Friday 16 January 2009 08:42:52 Hugo Ferreira wrote:
> 
>> I have implemented a simple Prolog like inference engine
>> to be used in machine learning algorithms (ILP). My first
>> basic test shows that inference is dismally slow (compared
>> to a Prolog compiler).
> 
>> Consequently I am looking for information on optimizing the code.
> 
> For implementing a Prolog-like language, you might want to look at
> this book on the Warren Abstract Machine:
> 
> http://web.archive.org/web/20030213072337/http://www.vanx.org/archive/wam/wam.html 
> 

Ok, new of this document. But I think this demands too-much effort.

> 
> You might also want to look at 'KANREN' and specifically 'miniKANREN':
> 
> http://kanren.sourceforge.net/
> 
> miniKANREN is a simple declarative logic programming system embedded
> into Scheme. I don't know how efficient the system is, but it might
> give you further ideas on how to implement such a system.
> 

Did not know about this. I'll take a look.

Thanks,
Hugo F.


> --- Peter
> 
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>