Find link

language:

Find link is a tool written by Edward Betts.

searching for Theorem Proving System 13 found (17 total)

Peter B. Andrews (434 words) [view diff] case mismatch in snippet view article find links to article

critical wounds. His research group designed the TPS, an automated theorem proving system for first-order and higher-order logic. A subsystem ETPS of TPS

Nuprl (522 words) [view diff] case mismatch in snippet view article find links to article

as FDL (Formal Digital Library). Nuprl functions as an automated theorem proving system and can also be used to provide proof assistance. Nuprl uses a type

SPASS (217 words) [view diff] no match in snippet view article find links to article

for Synergetic Prover Augmenting Superposition with Sorts. The theorem-proving system is released under the FreeBSD license. An extension of SPASS called

Paradox (theorem prover) (426 words) [view diff] case mismatch in snippet view article

University of Technology. It can a participate as part of an automated theorem proving system. The software is primarily written in the Haskell programming language

Larch Prover (1,558 words) [view diff] case mismatch in snippet view article find links to article

The Larch Prover, or LP for short, is an interactive theorem proving system for multi-sorted first-order logic. It was used at MIT and elsewhere during

CADE ATP System Competition (378 words) [view diff] exact match in snippet view article find links to article

science awards Sutcliffe, Geoff (2011). "The 5th IJCAR Automated Theorem Proving System Competition - CASC-J5". AI Communications. 24 (1): 75–89. doi:10

ATS (programming language) (2,267 words) [view diff] no match in snippet view article

counting before the program runs. Also, by using the integrated theorem-proving system of ATS (ATS/LF), the programmer may make use of static constructs

Michael J. C. Gordon (573 words) [view diff] no match in snippet view article find links to article

Kalvala, Sara (22 August 2017). "Sad news regarding Mike Gordon". HOL theorem-proving system. SourceForge. Retrieved 2 September 2017. Bowen, Jonathan P. (June

E (theorem prover) (937 words) [view diff] exact match in snippet view article

December 2009. Sutcliffe, Geoff (2009). "The 4th IJCAR Automated Theorem Proving System Competition--CASC-J4". AI Communications. 22 (1): 59–72. doi:10

Michael McRobbie (1,593 words) [view diff] case mismatch in snippet view article find links to article

McRobbie; Robert K. Meyer (August 1, 1986). "The KRIPKE automated theorem proving system". 8th International Conference on Automated Deduction. Lecture Notes

List of computer science awards (859 words) [view diff] exact match in snippet view article find links to article

Arimaa Challenge". Sutcliffe, Geoff (2011). "The 5th IJCAR Automated Theorem Proving System Competition - CASC-J5". AI Communications. 24 (1): 75–89. doi:10

Christoph Walther (1,363 words) [view diff] exact match in snippet view article find links to article

Dieter Hutter and Christoph Walther (1986). "The Karlsruhe Induction Theorem Proving System". In J.H. Siekmann (ed.). Proc. 8th CADE. LNAI. Vol. 230. Springer

Resolution (logic) (4,063 words) [view diff] exact match in snippet view article

and (6), needed for (7). Wilkins, D. (1973). QUEST: A Non-Clausal Theorem Proving System (Master's Thesis). University of Essex. Murray, Neil V. (February