DC parallelism of connection graph

Authors:
R. Loganantharaj
Affiliations:
Center for Advanced Computer Studies, USL, P.O. Box 44330, Lafayette, LA
Venue:
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Year:
1987

Citing 6
Cited 1

Logic for problem-solving

Logic for problem-solving
Parallel theorem proving with correction graphs

Proc. of the 8th international conference on Automated deduction
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
A Parallel Connection Graph Proof Procedure

GWAI '81 Proceedings of the German Workshop on Artificial Intelligence
Theoretical and implementational aspects of parallel link resolution in connection graphs (commutativity, dcdp parallelism, dc)

Theoretical and implementational aspects of parallel link resolution in connection graphs (commutativity, dcdp parallelism, dc)

Experience with Or-parallelism of connection graphs

CSC '91 Proceedings of the 19th annual conference on Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In general, theorem provers are relatively slow. Speed up can be achieved by directing the search towards finding a proof and by using parallelism. In this paper we discuss dc parallel link resolution of connection graph refutation.In dc parallelism, the links (edges) incident to distinct clauses are resolved in parallel. Concurrent resolution of dc links may result in missing links between resolvents. The previous solutions of the missing link problem are not satisfactory: one leads to an indefinite wait and the other one restricts the dc links and therefore reducing the amount of parallelism available when applied with strategies and heuristics. We provide a solution to the missing link problem that will not restrict the dc links or not lead to an indefinite wait. We also provide the correctness of our parallel algorithms. A proof procedure using dc parallelism is outlined and an efficient method to obtain very promising dc links towards finding the empty clause is also described. In all the algorithms, we used the conventional parallel constructs. Finally, we describe the realization of the parallel constructs with an Encore Multimax (a tightly coupled multiprocessor) primitives.