{'fraction_non_alphanumeric': 0.020930232558139535, 'fraction_numerical': 0.002325581395348837, 'mean_word_length': 5.1063829787234045, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Capturing well typed references in DTDs

Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simple schemas with well-typed references and showing that such schemas, called normalized ref-schemas, are expressible as formulas of Hybrid Modal Logic. The aim of the present paper is to extend normalized ref-schemas in order to allow one for general regular expressions and provide a fully general notion of schema capturing well-typed references, called ref-schemas. The main contribution of the paper is to show that ref-schemas are still expressible in Hybrid Modal Logic which entails that tools like for instance the tableau system developed in [9] can be used in order to check for constraint satisfiability in presence of refschemas.