Gandalf (theorem prover)

From Wikipedia, the free encyclopedia
  (Redirected from Gandalf theorem prover)
Jump to: navigation, search

Gandalf is a first-order automated theorem prover applied to several domain-specific tasks such as Semantic web. It has also participated in 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.

External links[edit]