| Vampire Theorem Prover |
Article Index for Vampire |
Shopping Prover |
Website Links For Vampire |
Information AboutVampire Theorem Prover |
| CATEGORIES ABOUT VAMPIRE THEOREM PROVER | |
| theorem provers | |
|
Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov . Its kernel implements the calculi of ordered , 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 is 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. EXTERNAL LINKS
|
|
|