depth bound the maximum depth that is permitted in a bounded depth-first search. depth-first a search in which children of a node are considered (recursively) before siblings are considered.
SLR performs linear derivations from the input clauses and a maintained set-of-support to obtain subgoals (usually unit clauses), such that the length of each derivation is no more than an assigned depth bound. [edit] See also ...
 
|