Surf these sites: 3TAP -- Many-valued tableau-based theorem prover developed at the University of Karlsruhe. It can be instantiated for arbitrary finitely-valued first-order logics, and it can handle equality (two-valued), sorts, and non-clausal input. Automated Reasoning Project -- 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). Bertrand -- First-order satisfiability checker and prover for the Macintosh. Database of Existing Mechanized Reasoning Systems -- A list (>50 entrys) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools LWB -- Logics Workbench PROTEIN -- theorem prover for first-order clause logic SAT hard instance generator and solution algorithms -- Utilities and algorithms by V. Z. Nuri SwitchMin Digital Circuit Minimizer -- Tool for minimizing boolean logic functions The Coq project -- Our work deals with effectively machine-checked formal mathematics. In practice, this includes the study of mathematical formalisms well-suited for implementations, the implementations themselves and the use of these for various applications. We are particulary interested in software correctness proofs The leanTAP Home Page -- Lean, Tableau-based Deduction (theorem prover for first order logic)
Help build the largest human-edited
directory on the web.