Evidence Algorithm and Inference Search in First-Order Logics

Lyaletski, Alexander V.

doi:10.1007/s10817-015-9346-0

Cited by 3 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Пізніше були отримані результати про коректність та повноту ряду класичних і інтуїціоністських модальних секвенційних числень, що володіють властивістю підформульності і використовують поняття допустимості та сумісності [19]. Ці дослідження знайшли своє більш повне відображення в [20] і [21].…”

Section: український період (1998теперішній час)unclassified

V.M. Glushkov and automated theorem proving in Ukraine: evidence algorithm evidence algorithm and SAD systems

Lyaletski¹

2020

MMS

View full text Add to dashboard Cite

Fifty years ago, in 1970, Academician V.M. Glushkov published a paper, in which he, along with a discussion of some problems of artificial intelligence, formulated a research program called Evidence Algorithm (EA) describing his vision of the problem of a computer support of human activity in looking for a proof of a particular theorem. V.M. Glushkov proposed to focus attention on the construction of an automated theorem-proving system performing simultaneous investigations in: creating formal natural languages for writing mathematical texts in a form accustomed to a human, constructing a procedure for a proof search based on the evolutionary developing of the machine notion of an evidence of a computer-made proof step, using the knowledge gained by the system during its operation and providing a user with the opportunity to assist to the system in its proof search process. Since the inception of EA, two serious attempts have been made to implement this program. The first led to the emergence in 1978 of a Russian-language automated theorem proving and the second led to the appearance in 2002 of its English-language modification named System for Automated Deduction (SAD). And if the development and trial operation of the first system were discontinued in 1992 after the output from service of the ES-line computers, on which it was realized, the SAD system, being placed on the website “nevidal.org”, is now still available in online mode. That is, at the current time, it is possible to carry out different experiments with the SAD system and to solve various problems that require rigorous mathematical reasoning. This work is devoted to a chronological description of studies on the implementation of the EA program for the entire period of its existence and to the highlighting of peculiarities of both the systems, as well as of their common features and distinguishes. Some possible ways of the further development of the SAD system are given.

show abstract

Section: український період (1998теперішній час)unclassified

V.M. Glushkov and automated theorem proving in Ukraine: evidence algorithm evidence algorithm and SAD systems

Lyaletski¹

2020

MMS

View full text Add to dashboard Cite

show abstract

“…In 2015, Alexander Lyaletski used Evidence Algorithm (EA) program and Search in First Order Logics to construct (sound and complete) quantifier-rule-free sequent calculi for classical and nonclassical logics, including the intuitionistic and modal cases [32].…”

Section: Related Work On Modal Logicmentioning

confidence: 99%

Logical analysis of emotions in text from natural language

Bel'tyukov¹,

Abbasi²

2019

Vestn. Udmurt. Univ. Mat. Mekh. Komp’yut. Nauki

View full text Add to dashboard Cite

The study of emotional text analysis today is one of the most interesting and developing areas. The emotions presented in the text and their analysis are a special topic of our interest. In this article, we will explore the various modal judgments in logic, the emotional model and their connection with the analysis of emotions. We will offer interpretations of some simple modalities in connection with information technologies for analyzing emotions in texts. We will expand the logic of the possible worlds; our modalities will better explain and comprehend this logic of the perceived state of the environment. We are presenting the logical formulas for defining the most common modalities for analyzing emotions from text. Our work is a continuation of the work done on modalities with more flexibility and completeness. The paper discusses the logical properties of emotional modalities, the logic of emotional evaluations and the definition of various modalities for analyzing emotions. We propose six different definitions of modalities and use three theorems to prove our hypothesis. This methodology also sets the directions for future research on logical modalities for analyzing emotions from text.

show abstract

Evidence Algorithm and Sad Systems: Past and Possible Future

Lyaletski

2021

Cybern Syst Anal

View full text Add to dashboard Cite

Evidence Algorithm and Inference Search in First-Order Logics

Cited by 3 publications

References 16 publications

V.M. Glushkov and automated theorem proving in Ukraine: evidence algorithm evidence algorithm and SAD systems

V.M. Glushkov and automated theorem proving in Ukraine: evidence algorithm evidence algorithm and SAD systems

Logical analysis of emotions in text from natural language

Evidence Algorithm and Sad Systems: Past and Possible Future

Contact Info

Product

Resources

About