Gandalf theorem prover

From Wikipedia, the free encyclopedia

You have new messages (last change).

The Gandalf theorem prover is the first-order theorem prover applied to several domain-specific tasks such as Semantic web. It has also participated in the The CADE ATP System Competition and had impressive results in that competition. It is programmed in the Scheme programming language which is then compiled to the C programming language using Hobbit from SCM.

[edit] External link

Comp Sci logo This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../g/a/n/Gandalf_theorem_prover.html"