Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata