Recall the definition of minimum covering tree, which supports a faster way to retrieve available rules from PRS without generating all the subtrees.
when node n fortunately to be the root of some minimum covering tree(s), we use the tree(s) to seek available PAS-based rules in PRS.