]>
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Dear Caml-List readers,
I plan to write some implementation of classical Inductive Logic
Programming strategies in OCaml and I would like to know if there exists
ocaml libraries for computational logic (first order logic) available
under a free software license.
I would also welcome thanksfully any advice or design guideline on data
structures for objects such as Horn clauses (datalog or with functors),
variable bindings and ideas to efficiently implement opertations such as
resolution and theta-subsumption test.
So far I have found an interesting implemantation of Hantao Zhang's
linear Robinson unification algorithm
(http://abaababa.ouvaton.org/caml/unify.ml) and graph based algorithms
for efficient theta-subsumtion test (http://citeseer.nj.nec.com/111654.html)
Thanks for any hint !
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (GNU/Linux)
Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org
iD8DBQFARhLDTsBRE+WZ2SARAky9AJ92gUlyc6gyjbIj1nIBq5MrWvW8rQCgk6II
ZVgTYE7MS1fwDhJtCpUNg2o=
=a2Od
-----END PGP SIGNATURE-----
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners