FACTOID # 3: South Carolina has the highest rate of violent crimes and aggravated assaults per capita among US states.
 Home   Encyclopedia   Statistics   States A-Z   Flags   Maps   FAQ   About 


FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:



(* = Graphable)



Encyclopedia > Gandalf theorem prover

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. Automated theorem proving (currently the most important subfield of automated reasoning) is the proving of mathematical theorems by a computer program. ... The Semantic Web is an evolution of the World Wide Web in which information is machine processable (rather than being only human oriented), thus permitting browsers or other software agents to find, share and combine information more easily. ... The Scheme programming language is a functional programming language and a dialect of Lisp. ... C is a general-purpose, procedural, imperative computer programming language developed in 1972 by Dennis Ritchie at the Bell Telephone Laboratories for use with the Unix operating system. ... SCM is an acronym for Software Configuration Management, and relates to configuration management (CM). ...

External link

  • Gandalf home page

  Results from FactBites:
Automated theorem proving (410 words)
The theorems of interest may be in traditional mathematical domains, or they may be in other fields such as digital computer design.
Another distinction is sometimes drawn between theorem proving and other techniques, where a process is considered to be theorem proving if it consists of a traditional proof, starting with axioms and producing new inference steps using rules of inference.
A good example of this was the machine-aided proof of the four color theorem, which was very controversial as the first claimed mathematical proof which was essentially impossible to check by hand.
CASC-JC Entrants' System Descriptions (4922 words)
E 0.6 [Sch99] is a purely equational theorem prover.
E 0.62 [Sch01] is a purely equational theorem prover.
Gandalf is a reolsution prover which implements a number of different basic strategies: binary ordered resolution for several orderings, versions of set-of-support resolution, binary unit resolution, hyperresolution.
  More results at FactBites »



Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:


Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m