ANALITIK (algorithmic language for the description of computing processes using analytical transformations)

Glushkov, V. M.; Bodnarchuk, V. G.; Grinchenko, T. A.; Dorodnitsyna, A. A.; Klimenko, V. P.; Letichevskiĭ, A. A.; Pogrebinskii, S. B.; Stognii, A. A.; Fishman, Yu. S.

doi:10.1007/bf01070461

Cited by 6 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hardware-interpreted source language was supplemented with tools for the manipulation with algebraic expressions. The ANALITIK [5] source language of these machines, which is one of the first languages of computer algebra, well-known in the West, made an appreciable impact on the development of symbolic and algebraic calculations.…”

Section: Artificial Intelligence In the Sense Of Glushkovmentioning

confidence: 99%

Glushkov’s evidence algorithm

2013

View full text Add to dashboard Cite

show abstract

Section: Artificial Intelligence In the Sense Of Glushkovmentioning

confidence: 99%

Glushkov’s evidence algorithm

2013

View full text Add to dashboard Cite

show abstract

“…It seems that somewhen in the middle of 1970, V.Glushkov decided to add "young forces" to the existing EA team, and he charged one of his former pupil V.Bodnarchuk to became the leader of the new team. At that time, V.Bodnarchuk was the head of a computer department; its members had just finished their work under a specialized mini-computer for engineering computation with the language "Analitik" [11].…”

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

“…., a n) is referred to as the result of application of this relationship to S. The equality of composites in this case would mean either their isomorphism or equivalence, in the general case, the relationship must have a condition P(x~,..., x n} that should be met by the sought-for objects al,..., a n. When a system of relationships has to be applied to all the subobjects of a composite, parallelism can be used both to test applicability and to apply the relationships simultaneously to several subobjects. The relevant procedures were developed in the ANALITIK language [14] and programming languages of the PRO~ EKT system. Problems of parallel implementation of relationships were studied in [15].…”

Section: Problem Levelmentioning

confidence: 99%