We define a configuration t of a dominance graph D to be a R-relative normal form of (the configurations of) D iff there is no other configuration t of D such that t → R t .
these are the configurations that can't be weakened further without obtaining a tree that is no longer a configuration of D. if R approximates entailment, then the R-relative normal forms approximate the weakest readings.