Mechanical theorem proving in the USSR; the Leningrad school
Mechanical theorem proving in the USSR; the Leningrad school
Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evidence Algorithm and Sequent Logical Inference Search
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities
Proceedings of the IIS'2002 Symposium on Intelligent Information Systems
Handbook of automated reasoning
Handbook of automated reasoning
Evidential Paradigm: The Logical Aspect
Cybernetics and Systems Analysis
The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Sequent forms of Herbrand theorem and their applications
Annals of Mathematics and Artificial Intelligence
The design and implementation of VAMPIRE
AI Communications - CASC
Connection Tableaux with Lazy Paramodulation
Journal of Automated Reasoning
System for Automated Deduction (SAD): A Tool for Proof Verification
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
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
On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi
SYNASC '08 Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
IBM Journal of Research and Development
On Herbrand-like Theorems for Cut-free Modal Sequent Logics
SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
On herbrand's theorem for intuitionistic logic
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
A research project aimed at the development of an automated theorem proving system was started in Kiev (Ukraine) in early 1960s. The mastermind of the project, Academician V. Glushkov, baptized it "Evidence Algorithm", EA1. The work on the project lasted, off and on, more than 40 years. In the framework of the project, the Russian and English versions of the System for Automated Deduction, SAD, were constructed. They may be already seen as powerful theoremproving assistants. The paper gives a retrospective view to the whole history of the development of the EA and SAD. Theoretical and practical results obtained on the long way are systematized. No comparison with similar projects is made.