MACHINE LEARNING ALGORITHMS FOR DUMMIES

Presented a problem plus a list of premises, dilemma-resolving reduces to searching to get a proof tree whose root node is labelled by an answer of the problem and whose leaf nodes are labelled by premises or axioms. In the case of Horn clauses, trouble-resolving search can be performed by reasoning forwards through the premises or backwards from t