SLD resolution


Also found in: Wikipedia.

SLD resolution

(logic, programming)
(Selected, Linear, Definite) Linear resolution with a selection function for definite sentences.

A definite sentence has exactly one positive literal in each clause and this literal is selected to be resolved upon, i.e. replaced in the goal clause by the conjunction of negative literals which form the body of the clause.

References in periodicals archive ?
Arg] propagates labels, implementing the SLD resolution procedure along with a consistency check every time new defeasible information is introduced in a proof.
Superclassicality was shown to hold for both argument construction and warrant with respect to SLD resolution.
Prolog's power as a programming language comes from the fact that when SLD resolution is used as the evaluation technique, a Horn clause can be understood as defining a procedure (in the ordinary sense of procedural languages, e.
As stated in the introduction, SLD resolution can be understood procedurally as executing a nondeterministic program with procedure calls.
Formally, SLD resolution is refutation complete for Horn clauses [15].
In our description of SLD resolution we concentrated on the procedural control, and handled parameter passing by matching an atom with the head of a rule and applying the match to every atom in the entire stack.