| submit a site to this category |
| wectar web site suggestions for this odp category |
|
|
ACL2 Version 2.7URL: http://www.cs.utexas.edu/users/moore/acl2/ ODP description: 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. Page title: ACL2 Version 3.1 ![]() |
|
|
PVSURL: http://pvs.csl.sri.com/ ODP description: 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. Page title: PVS Specification and Verification System ![]() |
|
|
IsabelleURL: http://www.cl.cam.ac.uk/Research/HVG/Isabelle/ ODP description: A generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). Includes logic, documentation and free download. ![]() |
|
|
LOOMURL: http://www.isi.edu/isd/LOOM/LOOM-HOME.html ODP description: 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. Page title: Loom ![]() |
|
|
The Coq ProjectURL: http://pauillac.inria.fr/coq/ ODP description: 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. Focuses on software correctness proofs. Page title: The Coq proof assistant ![]() |
|
|
Database of Existing Mechanized Reasoning SystemsURL: http://www-formal.stanford.edu/clt/ARS/systems.html ODP description: A list (>50 entries) of automatic resolution provers (like Otter), interactive provers (like PVS) and other mechanized reasoning tools. Page title: Mechanized Reasoning Systems ![]() |
|
|
Logic Software from CSLIURL: http://www-csli.stanford.edu/hp/Logic-software.html ODP description: By Jon Barwise and John Etchemendy. Page description: This page describes the text/software packages Hyperproof, Tarski's World, Turing's World, and The Language of First-order Logic. ![]() |
|
|
CrocoPat: Simple and Efficient Relational ProgrammingURL: http://mtc.epfl.ch/~beyer/CrocoPat/ ODP description: 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). Page title: CrocoPat: A Tool for Simple and Efficient Relational Computation ![]() |
|
|
ProofPowerURL: http://www.lemma-one.com/ProofPower/index/ ODP description: A suite of tools supporting specification and proof in Higher Order Logic (HOL) and in Z notation. ![]() |
|
|
DELORESURL: http://www.dfki.uni-kl.de/~miller/delores/ ODP description: A forward-chaining reasoning engine for defeasible logic, a less expressive but more efficient nonmonotonic logic. Page title: DELORES - nothingisreal.com ![]() |
|
|
ChurchURL: http://www.alcyone.com/software/church/ ODP description: 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. Page title: church ![]() |
|
|
MUltlogURL: http://www.logic.at/multlog/ ODP description: 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. Page title: Home page of MUltlog ![]() |
|
|
LWBURL: http://www.lwb.unibe.ch/ ODP description: Logics Workbench. Page title: The Logics Workbench Page description: the main page of the LWB Documentation ![]() |
|
|
j'Imp Theorem ProverURL: http://www.functologic.com/logic/jImp.html ODP description: 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. Page description: j'Imp is an automatic theorem prover based on set of support and ordered resolution for first-order logic. ![]() |
|
|
ParadoxURL: http://www.cs.chalmers.se/~koen/paradox/ ODP description: 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. Page title: Paradox -- A First-Order Logic Model Finder ![]() |
|
|
PROTEINURL: http://www.uni-koblenz.de/ag-ki/Implementierungen/Protein/ ODP description: A PROver with a Theory Extension INterface. Theorem prover for first-order clause logic, written in ECRC's Prolog-dialect ECLiPSe. Free download, documentation. Page title: Protein Page description: Homepage of the AI Research Group of the University Koblenz-Landau ![]() |
|
|
BertrandURL: http://www.uwosh.edu/faculty_staff/herzberg/Bertrand.html ODP description: 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. ![]() |
|
|
Tree Proof GeneratorURL: http://www.umsu.de/logik/trees ODP description: An implementation of the semantic tableaux method for classical propositional and predicate logic, written in JavaScript/DOM. ![]() |
|
|
Proof GeneralURL: http://proofgeneral.inf.ed.ac.uk ODP description: Comprehensive Gnu-Emacs and XEmacs interface for several theorem provers including Coq, Isabelle, Lego, and Phox. Page description: Proof General is an Emacs based generic interface for theorem provers ![]() |
|
|
llproverURL: http://bach.scitec.kobe-u.ac.jp/llprover/ ODP description: A linear logic prover that searches a cut-free proof for the given two-sided sequent of first-order linear logic. Page title: A Linear Logic Prover (llprover) ![]() |
|
| |