
Publication
PARALLELISM IN LOGICAL INFERENCE DURING ITS AUTOMATION
(STEF92 Technology, 2020-09-20, Aleksandr Shajkin, О. В. Аверина, Vladimir R. Babaev, Marina Lebedeva, Tatyana Khlynova)
Show more
It is well known that the process of inference is generally non-deterministic. Therefore, to develop effective inference algorithms, the problem of managing the inference search is very relevant. The solution to this problem is complicated by the fact that the predicate calculus is unsolvable. There is no method for establishing general validity or its absence for an arbitrary formula for calculating predicates. Nevertheless, if the formula for calculating predicates is valid, then there is a procedure for establi...
Informatics2020
