Selective Linear Definite clause resolution Symbolic AI
noun phrase
Definition: The basic inference rule of logic programming: a refinement of linear resolution with a selection function for definite clauses, which is sound and refutation-complete for Horn clauses. This is the standard characterization of SLD resolution in logic-programming literature and teaching materials [Lee, Hwang 2024].
Example in context: “SLD Resolution (Kowalski, 1974) is the backward chaining algorithm for logic programs.” [Lee, Hwang 2024]
Synonym: SLD resolution
Related terms: resolution; Horn clauses; logic programming; Prolog; backward chaining