1974
DOI: 10.1007/bf01068447
|View full text |Cite
|
Sign up to set email alerts
|

Organization of data for the obviousness algorithm seeking proofs of theorems in formalized theories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1974
1974
2005
2005

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The organization and data structures of EA are considered in [9]. It is noted that distinctive features of EA as a specially organized system of algorithms, the absence of orientation of modern computers toward the processing of data structures of EA, and the desire to use EA with other more sophisticated algorithms impose definite restrictions on the data of EA and these data have a special organization.…”
Section: Algebra Of Algorithms and Systems Of Algorithmic Algebrasmentioning
confidence: 99%
See 1 more Smart Citation
“…The organization and data structures of EA are considered in [9]. It is noted that distinctive features of EA as a specially organized system of algorithms, the absence of orientation of modern computers toward the processing of data structures of EA, and the desire to use EA with other more sophisticated algorithms impose definite restrictions on the data of EA and these data have a special organization.…”
Section: Algebra Of Algorithms and Systems Of Algorithmic Algebrasmentioning
confidence: 99%
“…A description of functioning of the algorithm of logical inference search or Evidence Algorithm (EA) whose basic principles were formulated by V. M. Glushkov is presented in [8,9]. In [8], an approach to the solution of the problem of computer-aided theorem proving in formalized theories is proposed.…”
Section: Algebra Of Algorithms and Systems Of Algorithmic Algebrasmentioning
confidence: 99%