A Naive h function is straightforwardly defined as the annotation of each local rule part of the tree in a bottom-up fashion: 1 Base: When ∃a ∈ A such that h(a) = ⊥ we say that the annotation has failed.
the naive procedure fails in a large number of cases.