Vampire theorem prover

Vampire theorem prover

Vampire is an automatic theorem prover for first-order classical logic developed in the Computer Science Department of the University of Manchester by Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov. It has won the "world cup for theorem provers" ( [http://www.cs.miami.edu/~tptp/CASC/ the CADE ATP System Competition] ) in the most prestigious CNF (MIX) division for nine years (1999, 2001–2008).

Its kernel implements the calculi of ordered binary resolution and superposition for handling equality. The splitting rule and negative equality splitting are simulated by the introduction of new predicate definitions and dynamic folding of such definitions. A number of standard redundancy criteria and simplification techniques are used for pruning the search space: subsumption, tautology deletion (optionally modulo commutativity), subsumption resolution, rewriting by ordered unit equalities, basicness restrictions and irreducibility of substitution terms. The reduction orderings used are the standard Knuth-Bendix ordering and a special non-recursive version of the Knuth-Bendix ordering.

A number of efficient indexing techniques are used to implement all major operations on sets of terms and clauses. Run-time algorithm specialisation is used to accelerate some costly operations, e.g., checks of ordering constraints.

Although the kernel of the system works only with clausal normal forms, the preprocessor component accepts a problem in the full first-order logic syntax, clausifies it and performs a number of useful transformations before passing the result to the kernel. When a theorem is proven, the system produces a verifiable proof, which validates both the clausification phase and the refutation of the CNF.

Sources and executables of the system can be obtained from the competition archive of [http://www.cs.miami.edu/~tptp/CASC/21/ CASC] , however Vampire is not open source and no modification, distribution, or even use of Vampire is permitted without a license.

External links

* [http://www.voronkov.com/ Prof. Andrei Voronkov]
* [http://www.freewebs.com/riazanov/ Dr. Alexandre Riazanov]
* [http://www.cs.miami.edu/~tptp/CASC/ Annual competition of theorem provers (CASC)]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Vampire (disambiguation) — A vampire is an undead monster in legend and fiction.Vampire may also refer to:General*Vampire bat, a bat that feeds on blood *Vampire Squid, a small deep sea creature *Energy vampire or psychic vampire, a being said to have the ability to feed… …   Wikipedia

  • Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • Run-time algorithm specialisation — In computer science, run time algorithm specialisation is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically,… …   Wikipedia

  • Sigma knowledge engineering environment — In the computer science fields of knowledge engineering and ontology, the Sigma knowledge engineering environment is an open source computer program for the development of formal ontologies. It is designed for use with the Suggested Upper Merged… …   Wikipedia

  • Demostración automática de teoremas — Saltar a navegación, búsqueda Para otros usos de este término, véase Demostración. La demostración automática de teoremas (de siglas ATP, por el término en inglés …   Wikipedia Español

  • Superposition calculus — The superposition calculus is a calculus for reasoning in equational first order logic. It has been developed in the early 1990s and combines concepts from first order resolution with ordering based equality handling as developed in the context… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”