Several classes of path constraints for semistructured data are analysed and a number of
decidability and complexity results proved for such constraints. While some of these
decidability results were known before, it is believed that the improved complexity bounds
are new. Proofs are based on techniques from modal logic and automata theory. This modal
logic perspective sheds additional light on the reasons for previously known decidability and
complexity results.