Glushkov’s evidence algorithm

Glushkov’s general approaches to the problem of artificial intelligence are considered. In particular, the history of research conducted in line with the Evidence Algorithm program initiated by V. M. Glushkov is described in detail. The results obtained within this program are analyzed.

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

[2]  C. Gordon Bell Computer Engineering , 1998 .

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

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

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

[6]  David R. Gilbert,et al.  A Model for Interaction of Agents and Environments , 1999, WADT.

[7]  Alexander A. Letichevsky Algebra of behavior transformations and its applications , 2005 .

[8]  Alexander A. Letichevsky,et al.  Computations in APS , 1993, Theor. Comput. Sci..

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

[10]  Anatoli N. Chebotarev,et al.  Consistency Checking of Automata Functional Specifications , 1993, LPAR.

[11]  Grigori Mints,et al.  Proof theory in the USSR 1925–1969 , 1991, Journal of Symbolic Logic.

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

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

[14]  M. Morokhovets,et al.  Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system , 1996 .

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

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

[17]  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.

[18]  Paul C. Gilmore,et al.  A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus , 1959, IFIP Congress.

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

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

[21]  Stig Kanger,et al.  A Simplified Proof Method for Elementary Logic , 1959 .

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

[23]  M. K. Morokhovets A modified unification procedure , 1984 .

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