Parallel and Efficient Implementation of the Compartmentalized Connection Graph Proof Procedure: Resolution to Unification

This paper documents aspects of the development of a logic programming paradigm with implicit control, based in a compartmentalized connection graph theorem prover. Whilst the research has as it main goal the development of a language in which programs can be written with much less explicit control than PROLOG and its existing successors, a secondary goal is to exploit the immense parallelism inherent in the connection graph. This is what is in focus in this presentation.