Use of heuristic procedures in search programs for proofs of theorems (survey)

Kapitonova, Yu. V.; Degtyarev, Anatoli; Lyaletskii, A. V.

doi:10.1007/bf01068588

Search citation statements

Order By: Relevance

Paper Sections

Select...

Ea and Russian Sad (1971 -1992)1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the very beginning, V.Bodnarchuk has formulated the following tasks: -careful revision of everything that was done previously by the "old team"; -detailed analysis of mathematical texts in various domains; -preparation of two surveys: (1) of combinatorial proof-search methods (published, see [16]) and (2) of using heuristics in proof search (published, see [18])…”

Section: Ea and Russian Sad (1971 -1992)mentioning

confidence: 99%

Evidence Algorithm and System for Automated Deduction: A Retrospective View

Lyaletski

Verchinine

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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", EA 3 . 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 4 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.

show abstract

Section: Ea and Russian Sad (1971 -1992)mentioning

confidence: 99%