The first part of this article concerns certain assumed trends of the development of the GUHA method. Particular attention was paid to the calculus of open observational formulae as a means for making it possible to declare derived quantities as parameters of GUHA procedures. In the second part of
Some remarks on computer realizations of GUHA procedures
β Scribed by Jan Rauch
- Publisher
- Elsevier Science
- Year
- 1978
- Weight
- 303 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0020-7373
No coin nor oath required. For personal study only.
β¦ Synopsis
Experience from the work on a computer realization of the GUHA method (implicational and associational version) is summarized and some general observations are presented. ' β’, Vm), vJ= 1 iff vt= j and vj=0 iff vl+j; similarly, vX= (~,..., ~m), ~= 1 iff vt = x and ~ = 0 iff vi 4:x. The tuple (v Β° ..... v h, v x ) is called the semantical representation of the quantity F. Using the functions CON, DIS and NEG we can easily obtain semantical representation of each open formula q~, starting from the vector llmll of its values; using NNB we obtain necessary frequencies.
Remarks on the algorithm of the associational and implicational G U HA procedure
The procedure has to produce all prime sentencesβ’ By definition, a relevant question is 23
π SIMILAR VOLUMES
Some applications of the GUHA method of mechanized hypothesis formation in pedagogy, economics and sports are described with emphasis on constructions of two-valued data models. The adequacy of the used procedures is partly discussed on the basis of concrete results and in the comparison with other
Positional differential games of pursuit with target for-conflict-control systems, non-linear with respect to the phase vector, are considered. The problems investigated are approximate construction of the set of positional absorption and construction of control procedures guaranteeing guidance to t