Scholarly record
PARALLELISM IN LOGICAL INFERENCE DURING ITS AUTOMATION
Abstract
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 establishing this fact. The effectiveness of the management of the search for a logical conclusion is of particular importance with a large amount of knowledge being processed, their complex structure and the exponential growth of their volume in the process of inference. It is desirable to reduce at each step of inference the number of considered objects of application of inference methods and use an algorithm that allows you to make the most successful choice of such an object. It is necessary to exclude from the further consideration objects with pure letters, tautologies and absorbed objects in a timely manner. It is important to be able to apply both an inference method in parallel in several directions and different inference methods at the same time. We have already considered the simultaneous use of different methods at different steps of the same inference process. In this paper, types of parallelism in logical inference are considered. We propose the use of different methods applied to several objects simultaneously. For objects exposed on the basis of inference methods, various types of their location in the structure are considered. The results of this effect are shown in the form of a change in the corresponding fragment of the structure.
Publication Impact Profile
- Captures
- Mendeley - Readers: 1
Publication details
References4
A. Shajkin, E. Rudakovskaya, V. Osipchik, E. Gordeeva, M. Meladze. Some Generalization of the Resolution Method. International Multidisciplinary Scientific GeoConference Surveying Geology and Mining Ecology Management, SGEM. №19 - STEP92 Technology Ltd Sofia, Bulgaria, 2019: pp. 619-626.
J.A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM. 1965 12 (1): pp. 23–41.
Maslov, S. Ju. An inverse method of establishing deducibility in the classical predicate calculus. Dokl. Akad. Nauk SSSR, 159, 1964: pp. 17–20.
Averin A.I., Vagin V.N., Khamidulov M.K. The Investigation of Algorithms of Parallel Inference by the Steamroller Problem // J. of Comp. and Syst. Sci. Int. 2000. V.39. N5. P. 758-765.
View or Download full articleAccess options
SWS access login
Login as SWS Scientific CommitteeLogin as SWS Scientific PartnerLogin as SWS AuthorAuthors and approved SWS contributors will read and export their own linked papers after identity matching by SWS profile, email and SGEM GlobalID.
For librarian assistance: [email protected]
Purchase Instant Access
- Article can be downloaded after successful payment.
- Article may be used according to SWS library access terms.
- Article cannot be redistributed.