VOICE SEARCH OPTIMIZATION - AN OVERVIEW

Offered a challenge plus a list of premises, difficulty-fixing minimizes to searching for your proof tree whose root node is labelled by an answer of the challenge and whose leaf nodes are labelled by premises or axioms. In the situation of Horn clauses, challenge-resolving search is usually carried out by reasoning forwards in the premises or back