Given a difficulty along with a set of premises, difficulty-fixing cuts down to searching to get a proof tree whose root node is labelled by a solution of the situation and whose leaf nodes are labelled by premises or axioms. In the situation of Horn clauses, problem-fixing search is usually perform