10. The system as recited in claim 9 , wherein at least one subgoal of the first proof graph comprises a top-level predicate of the first proof graph, a predicate to be solved next, and a list of predicates that are to be solved thereafter.
9. The system as recited in claim 8 , wherein the deterministic algorithm utilizes an answer table that maps predicates to sets of ground predicates and a wait table that maps predicates to subgoals of the first proof graph.