  |
http://pvs.csl.sri.com/ - 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. |
| |
Isabelle - http://www.cl.cam.ac.uk/Research/HVG/Isabelle/
A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download. |
| |
Automated Reasoning Project - http://cslab.anu.edu.au/ar/
Web resource provided by research group. Includes access to software developed by the team, covering such projects as FINDER (Finite Domain Enumerator), MaGIC (Matrix Generator for Implication Connectives) and Kripke (A theorem prover for the relevant logic LR). |
| |
Logic Software from CSLI - http://www-csli.stanford.edu/hp/Logic-software.html
By Jon Barwise and John Etchemendy. |
| |
Proof General - http://proofgeneral.inf.ed.ac.uk
Comprehensive Gnu-Emacs and XEmacs interface for several theorem provers including Coq, Isabelle, Lego, and Phox. |
| |
ACL2 Version 2.7 - http://www.cs.utexas.edu/users/moore/acl2/
A programming language in which you can model computer systems and a tool to help prove properties of those models. Available under GPL and runs on various platforms. Includes related download links. |
| |
http://www.cs.chalmers.se/~koen/paradox/ - http://www.cs.chalmers.se/~koen/paradox/
A tool that processes first-order logic problems and tries to find finite-domain models for them; written by Koen Claessen and Niklas Sörensson. Haskell and C++; free download under GPL. |
| |
Database of Existing Mechanized Reasoning Systems - http://www-formal.stanford.edu/clt/ARS/systems.html
A list (over 50 entries) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools. |
| |
http://www.alcyone.com/software/church/ - http://www.alcyone.com/software/church/
Program understands the different types of lambda expressions, can extract lists of variables (both free and bound) and subterms, and can simplify complicated expressions. Uses Python. |
| |
Bertrand - http://www.uwosh.edu/faculty_staff/herzberg/Bertrand.html
Bertrand solves sets of first-order predicate logic statements for satisfiability (consistency), validity, and equivalence. It also checks single statements for "logical truth" (tautology) and "logical falsity" (self-contradiction). Subject-identity is supported. User can "step through" the solution algorithm as Bertrand solves a problem, and/or check the graphic tree produced. |
| |
CrocoPat: Simple and Efficient Relational Programming - http://mtc.epfl.ch/~beyer/CrocoPat/
CrocoPat manipulates relations of any arity, including graphs (which are binary relations). Its simple and expressive query and manipulation language is based on first-order predicate calculus. The implementation is based on the data structure binary decision diagram (BDD). |
| |
http://www.uni-koblenz.de/ag-ki/Implementierungen/Protein/ - http://www.uni-koblenz.de/ag-ki/Implementierungen/Protein/
A PROver with a Theory Extension INterface. Theorem prover for first-order clause logic, written in ECRC's Prolog-dialect ECLiPSe. Free download, documentation. |
| |
http://staff.science.uva.nl/~ulle/WinKE/ - http://staff.science.uva.nl/~ulle/WinKE/
An interactive proof assistant based on analytic tableaux, and designed for the teaching of deductive reasoning. Ordering information is available at this site, as are academic papers on the design of the software. |
| |
Tree Proof Generator - http://www.umsu.de/logik/trees
An implementation of the semantic tableaux method for classical propositional and predicate logic, written in JavaScript/DOM. |
| |
http://www.dfki.uni-kl.de/~miller/delores/ - http://www.dfki.uni-kl.de/~miller/delores/
A forward-chaining reasoning engine for defeasible logic, a less expressive but more efficient nonmonotonic logic. |
| |
DC Proof Online - http://www.dcproof.com
New proof-writing software to teach the fundamentals of logic and proof. Enables users/students to write error-free proofs by selecting rules of inference, axioms, etc. from convenient drop-down menus. Includes tutorial and exercises. |
| |
j'Imp Theorem Prover - http://www.functologic.com/logic/jImp.html
An automatic theorem prover based on set of support and ordered resolution for first-order logic. j'Imp is part of the Orbital library. This library is a Java class providing object-oriented representations and algorithms for logic, mathematics, and artificial intelligence. |
| |
ModLeanTAP: Lean Tableau-based Deduction for Propositional Modal Logics - http://i12www.ira.uka.de/modlean/
Lean Tableau-based Deduction for Propositional Modal Logics. By Bernhard Beckert. |
| |
http://www.logic.at/multlog/ - http://www.logic.at/multlog/
Takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and clause formation rules for this logic. |
| |
http://www.informatik.tu-darmstadt.de/pm/verifun/ - http://www.informatik.tu-darmstadt.de/pm/verifun/
A semi-automated system for the verification of statements about programs written in a functional programming language. The system is capable of following fully-automated routines for theorem proving and hypotheses formation, as well as operating interactively when these routines fail. |