The PVS Specification and Verification System PVS 3.0 Beta Released (20 July 2002) General PVS Information What is PVS PVS Papers and Bibliography Mailing Lists What's New PVS Documentation System Manuals and Semantics Examples and Tutorials Obtaining and Using PVS Download PVS PVS License Getting Help PVS Libraries Suggestions for Enhancements Search/Submit Bugs Formal Methods Program and SRI ...

Home Logics Documentation Download Isabelle What is Isabelle Isabelle is a popular generic theorem proving environment developed at Cambridge University (Larry Paulson) and TU Munich (Tobias Nipkow). These pages provide general information on Isabelle, more specific information is available from the local pages Isabelle at Cambridge Isabelle at Munich See there for information on projects done ...

This page describes the text/software packages Hyperproof, Tarski's World, Turing's World, and The Language of First-order Logic.

News from March 28, 2002: Ontosaurus 1.9 has been released! It is available for download. Major change from 1.8 is the addition of limited browsing of production rules. There were also some minor bug fixes and improvements to Macintosh Common Lisp specific code. Loom 4.0 is available for download. Loom Project Home Page Loom is a research project in the Artificial Intelligence research group at ...

The main page of the LWB Documentation ...

This page represents the current state of an ongoing effort to collect information about existing automated reasoning systems. One objective is to provide concise useful information for people who have need for such a system and don't want to `roll their own'. Another objective is to provide a single place where information about existing systems can be accessed, thus providing an overview of ...

ProofPower ProofPower is a suite of tools supporting specification and proof in Higher Order Logic (HOL) and in the Z notation. The suite comprises the following products: PPTex - The ProofPower interface to TeX and LaTeX. PPXpp - The X Windows front-end for ProofPower PPHol - The HOL specification and proof development system PPZed - The Z specification and proof development system PPDaz - The ...

MUltlog MUltlog is a system which 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. All generated rules are optimized regarding their branching degree. The output is in the form of a scientific paper written in LaTeX. As an example, this specification of three-valued G ...

Homepage of the AI Research Group of the University Koblenz-Landau ...

WinKE Home Software Papers Images Contact ...

MUltseq MUltseq is a program that can be used to decide the validity of finitely-valued formulas, the consequence relation, and the validity of equations and quasi-equations in certain finite algebras. In its core, MUltseq is a generic sequent prover for propositional finitely-valued logics. It is intended as companion for MUltlog which computes optimized sequent rules from the truth tables of a ...

Lean, Tableau-based Deduction INDEX: what is leanTAP papers source code contact address This is the home page of lean , a complete and sound theorem prover for first-order logic. What is lean was invented by Bernhard Beckert and Joachim Posegga. It is written in Prolog and implements a complete and sound theorem prover for classical first-order logic based on free-variable semantic tableaux.