Given an issue as well as a list of premises, difficulty-fixing lowers to searching for any proof tree whose root node is labelled by a solution of the challenge and whose leaf nodes are labelled by premises or axioms. In the case of Horn clauses, challenge-resolving search is usually carried out by reasoning forwards with the premises or backwards… Read More