System for Automated Deduction (SAD): A Tool for Proof Verification

Authors:
Konstantin Verchinine;Alexander Lyaletski;Andrei Paskevich
Affiliations:
Université Paris 12, IUT Sénart/Fontainebleau, 77300 Fontainebleau, France;Kyiv National Taras Shevchenko University, Faculty of Cybernetics, 03680 Kyiv, Ukraine;Université Paris 12, Laboratoire d'Algorithmique, Complexité et Logique, 94010 Créteil, France
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 5
Cited 6

The TPTP Problem Library

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
S PASS Version 2.0

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The design and implementation of VAMPIRE

AI Communications - CASC
Computer assisted reasoning with MIZAR

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Toward mechanical mathematics

IBM Journal of Research and Development

On Correctness of Mathematical Texts from a Logical and Practical Point of View

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Evidence algorithm and system for automated deduction: a retrospective view

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Parsing and disambiguation of symbolic mathematics in the Naproche system

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Premise selection in the naproche system

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A tactic language for declarative proofs

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Glushkov's evidence algorithm

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a proof assistant called SAD is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (a brief description of which is also given) and checks their correctness. We give a short description of SAD and a series of examples that show what can be done with it. Note that abstract notion of correctness on which the implementation is based, can be formalized with the help of a calculus (not presented here).