 Automated Reasoning Project
http://cslab.anu.edu.au/ar/
Web resource provided by research group. Includes access to software developed by the team, coverering such projects as FINDER (Finite Domain Enumerator), MaGIC (Matrix Generator for Implication Connectives) and Kripke (A theorem prover for the relevant logic LR).
 MUltlog
http://www.logic.at/multlog/
Takes as input the specification of a finitelyvalued firstorder logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic.
 The Coq Project
http://pauillac.inria.fr/coq/
Deals with effectively machinechecked formal mathematics. In practice, this includes the study of mathematical formalisms wellsuited for implementations, the implementations themselves and the use of these for various applications. Focuses on software correctness proofs.
 LOOM
http://www.isi.edu/isd/LOOM/LOOMHOME.html
A language and environment for constructing intelligent applications. It is a research project in the Artificial Intelligence research group at the University of Southern California's Information Sciences Institute. The goal of the project is to develop and field advanced tools for knowledge representation and reasoning in Artificial Intelligence.
 PVS
http://pvs.csl.sri.com/
The PVS Specification and Verification System. Available for Sparc machines with Solaris 2 and Intel x86 Machines with Linux compatible with Redhat 5 or later. Required is Emacs (version 19 or later), recommended LaTeX and Tcl/Tk. Download by FTP.
 Paradox
http://www.cs.chalmers.se/~koen/paradox/
A tool that processes firstorder logic problems and tries to find finitedomain models for them; written by Koen Claessen and Niklas Sörensson. Haskell and C++; free download under GPL.
 DC Proof Online
http://www.dcproof.com
New proofwriting software to teach the fundamentals of logic and proof. Enables users/students to write errorfree proofs by selecting rules of inference, axioms, etc. from convenient dropdown menus. Includes tutorial and exercises.
 VeriFun
http://www.informatik.tudarmstadt.de/pm/verifun/
A semiautomated system for the verification of statements about programs written in a functional programming language. The system is capable of following fullyautomated routines for theorem proving and hypotheses formation, as well as operating interactively when these reoutines fail.
