Deduction-seeking procedures and transitive relations

Morokhovets, M. K.

doi:10.1007/bf01074730

Search citation statements

Order By: Relevance

Paper Sections

Select...

Evolution Of Studies On the Evidence Algorithm1

Theoretical Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2013

Publication Types

Select...

Article1

Book1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vershinin and Morokhovets have developed and investigated a number of strategies for the inference of statements with restricted quantifiers [44], Morokhovets have implemented one of them. She has also proposed and implemented negative hyperresolution strategies: based on the "semantic" unification that consider relations among mathematical concepts, and with the embedded relation transitivity axiom [45,46]. The both procedures used the advantages of theorem proving in the environment of an integrated TL-text.…”

Section: Evolution Of Studies On the Evidence Algorithmmentioning

confidence: 99%

Glushkov’s evidence algorithm

2013

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Evolution Of Studies On the Evidence Algorithmmentioning

confidence: 99%

Glushkov’s evidence algorithm

2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…The transitivity axiom clearly is among them. M.Morokhovets proved that for some large class of transitive relations, this axiom may be eliminated and replaced by a special inference rule which can be controlled to shorten the search space [57].…”

Section: Theoretical Workmentioning

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

Deduction-seeking procedures and transitive relations

Cited by 2 publications

References 2 publications

Glushkov’s evidence algorithm

Glushkov’s evidence algorithm

Evidence Algorithm and System for Automated Deduction: A Retrospective View

Contact Info

Product

Resources

About