Theoretical and implementational aspects of parallel-link, resolution in connection graphs

Thesis/Dissertation · Tue Jan 01 04:00:00 EST 1985

OSTI ID:5220048

Loganantharaj, R

Resolution theorem provers are relatively slow and can generally be speeded up by using parallelism and by directing the search towards an empty clause. In this research, focus is on the application of parallelism to connection graph refutation. The presence of the complete search space during connection-graph refutations suggests the opportunity to use parallel evaluation strategies to improve the efficiency of a generally very slow process. The Pseudo links are not considered for a parallel link resolution because they stand for different copies of a clause. The different kinds of parallelism identified in connection graph refutations are: or parallelism, and parallelism, and dc parallellism. Conditions for the correctness of dc parallel connection graph refutations are shown, resulting in dcpd parallellism. The dcdp parallelism, the links which are incident to distinct clauses and edge disjoint pairs are resolved in parallel. The complexity of the problem of optimally selecting the potential parallel links is equivalent to solving the optimal graph coloring problem. Fortunately, optimal solutions to this NP-hard problem are not crucial. The author describes the parallel solution of a suboptimal graph coloring algorithm, and provides a complete set of algorithms to implement dcdp parallel link resolution on a shared memory MIMD architecture.

• Research Organization: Colorado State Univ., Fort Collins (USA)
• OSTI ID: 5220048
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COLOR
COMPUTER ARCHITECTURE
COMPUTER GRAPHICS
MATHEMATICAL LOGIC
OPTICAL PROPERTIES
OPTIMIZATION
ORGANOLEPTIC PROPERTIES
PARALLEL PROCESSING
PHYSICAL PROPERTIES
PROGRAMMING
RESOLUTION