MACHINE LEARNING ALGORITHMS FOR DUMMIES

Supplied a difficulty plus a set of premises, trouble-resolving decreases to searching for the proof tree whose root node is labelled by a solution of the condition and whose leaf nodes are labelled by premises or axioms. In the situation of Horn clauses, difficulty-fixing search may be done by reasoning forwards with the premises or backwards from