Evidence algorithm and system for automated deduction: a retrospective view

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.

[1]  Zdzisław Pawlak,et al.  Automatic Theorem-Proving , 1967 .

[2]  Christoph Weidenbach,et al.  SPASS Version 3.5 , 2009, CADE.

[3]  A. A. Stognii,et al.  Aspects of the development of digital computer structures in connection with their software systems , 1967 .

[4]  Christoph Weidenbach,et al.  System Description: SpassVersion 3.0 , 2007, CADE.

[5]  A. I. Malashonok,et al.  Algorithm and computer experiment for seeking proofs of theorems in the predicate calculus , 1972 .

[6]  Konstantin Verchinine,et al.  System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities , 2002, Intelligent Information Systems.

[7]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[8]  Konstantin Verchinine,et al.  On verification tools implemented in the System for Automated Deduction , 2022 .

[9]  M. K. Morokhovets,et al.  Strategies of the search for derivation of statements with restricted quantifiers , 1983 .

[10]  Alan Robinson,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[11]  Alexander V. Lyaletski.  HERBRAND THEOREMS: THE CLASSICAL AND INTUITIONISTIC CASES , 2008 .

[12]  Alexander V. Lyaletski,et al.  The SAD System: Deductive Assistance in an Intelligent Linguistic Environment , 2006, 2006 3rd International IEEE Conference Intelligent Systems.

[13]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[14]  Boris Konev,et al.  Tableau Method with Free Variables for Intuitionistic Logic , 2006, Intelligent Information Systems.

[15]  Alexander V. Lyaletski.  On Some Problems of Efficient Inference Search in First-Order Cut-Free Modal Sequent Calculi , 2008, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[16]  Martin D. Davis,et al.  The Early History of Automated Deduction , 2001, Handbook of Automated Reasoning.

[17]  Yu. V. Kapitonova,et al.  Use of heuristic procedures in search programs for proofs of theorems (survey) , 1973 .

[18]  A. A. Stognii,et al.  ANALITIK (algorithmic language for the description of computing processes using analytical transformations) , 1971 .

[19]  K. P. Vershinin,et al.  System for processing mathematical texts , 1979 .

[20]  Andrei Voronkov,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[21]  Konstantin Verchinine,et al.  Reasoning inside a formula and ontological correctness of a formal mathematical text , 2007 .

[22]  M. K. Morokhovets.  Deduction-seeking procedures and transitive relations , 1985 .

[23]  F. V. Anufriev,et al.  The obviousness algorithm , 1972 .

[24]  Andriy Paskevych.  Méthodes de formalisation des connaissances et des raisonnements mathématiques : aspects appliqués et théoriques , 2007 .

[25]  A. P. Zhezherun.  Decidability of the unification problem for second-order languages with unary functional symbols , 1979 .

[26]  Alexander V. Lyaletski.  Sequent forms of Herbrand theorem and their applications , 2005, Annals of Mathematics and Artificial Intelligence.

[27]  Andrei Voronkov,et al.  Equality control methods in machine theorem proving , 1986, Cybernetics.

[28]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[29]  Victor M. Glushkov.  Problems in the Theory of Automata and Artificial Intelligence , 1971 .

[30]  Freek Wiedijk,et al.  The Seventeen Provers of the World, Foreword by Dana S. Scott , 2006, The Seventeen Provers of the World.

[31]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[32]  V. F. Kostyrko,et al.  A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories , 1972 .

[33]  Alexander V. Lyaletski,et al.  Evidential Paradigm: The Logical Aspect , 2003 .

[34]  Boris Konev,et al.  On Herbrand's Theorem for Intuitionistic Logic , 2006, JELIA.

[35]  Hao Wang,et al.  Toward Mechanical Mathematics , 1960, IBM J. Res. Dev..

[36]  Konstantin Verchinine,et al.  On Correctness of Mathematical Texts from a Logical and Practical Point of View , 2008, AISC/MKM/Calculemus.

[37]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[38]  K. P. Vershinin,et al.  Construction of a practical formal language for mathematical theories , 1972 .

[39]  Alexander V. Lyaletski.  On Herbrand-like Theorems for Cut-free Modal Sequent Logics , 2009, 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[40]  Stephan Schulz,et al.  System Description: E 0.81 , 2004, IJCAR.

[41]  Vladimir Lifschitz,et al.  Mechanical theorem proving in the USSR; the Leningrad school , 1986 .

[42]  Yu. V. Kapitonova,et al.  Automatic search for proofs of mathematical theorems and intelligent computers , 1972 .

[43]  A. V. Lyaletskii.  A variant of Herbrand's theorem for formulas in prenex form , 1981 .

[44]  Alexander V. Lyaletski,et al.  Evidence Algorithm and Sequent Logical Inference Search , 1999, LPAR.

[45]  Konstantin Verchinine,et al.  SAD as a mathematical assistant - how should we go from here to there? , 2006, J. Appl. Log..

[46]  A. I. Degtyarev.  Question of constructing a problem-oriented procedure for the proof of theorems , 1973 .

[47]  Konstantin Verchinine,et al.  Theorem Proving and Proof Verification in the System SAD , 2004, MKM.

[48]  Andrey PaskevichCyberetics.  Goal-driven Inference Search in Classical Propositional Logic , 2007 .

[49]  A. Voronkov,et al.  Automatic theorem proving. II , 1987 .

[50]  Martin Davis.  Chapter 1 – The Early History of Automated Deduction: Dedicated to the memory of Hao Wang , 2001 .

[51]  K. P. Vershinin,et al.  Relationship between formal language of mathematical theories and axiomatic systems of the theory of sets , 1973 .

[52]  J. A. Robinson,et al.  Handbook of Automated Reasoning (in 2 volumes) , 2001 .

[53]  Andrei Paskevich,et al.  Connection Tableaux with Lazy Paramodulation , 2006, Journal of Automated Reasoning.

[54]  V. V. Fedyurko,et al.  An algorithm for proving theorems in group theory , 1966 .

[55]  Konstantin Verchinine,et al.  System for Automated Deduction (SAD): A Tool for Proof Verification , 2007, CADE.

[56]  V. M. Glushkov,et al.  Some problems in the theories of automata and artificial intelligence , 1970 .