By Topic

Parallel inference on connection graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vagin, V.N. ; Dept. of Appl. Math., Power Eng. Inst., Moscow, Russia ; Salapina, N.O.

The paper presents a theoretical justification and description on the practical implementation of theorem proving problems in the first order predicate logic by using connection graphs. The basic definitions and concepts are given. Two types of parallelism in a process of a deductive inference are introduced. The sequential and parallel inference algorithms are described. The practical implementation of the sequential and parallel inference system is presented and analyzed. Examples of the theorem proving problems are discussed

Published in:

Intelligent Control (ISIC), 1998. Held jointly with IEEE International Symposium on Computational Intelligence in Robotics and Automation (CIRA), Intelligent Systems and Semiotics (ISAS), Proceedings

Date of Conference:

14-17 Sep 1998