sentences:  Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top.Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy.Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree.