Logic programming with pseudo-resolution

This paper presents a new proof technique for Automated Reasoning and Logic Programming which based on a generalization of the original Connection Graph paradigm of Kowalski and provides a methodology for Logic Programming in this framework. We show how execution of a logic program can be executed in the logarithm of the number of steps taken by PROLOG and standard resolution theorem provers, or better. This paper deals primarily with recursion, both in relation its exploitation and its explication. In dealing with explicit recursion, a modified “compartmentalized” connection graph framework emerges. In dealing with implicit recursion, a filter for the compartmentalized connection graph emerges which forces recursion to be explicitly represented. The method is demonstrated on standard PROLOG examples.