{'fraction_non_alphanumeric': 0.009533898305084746, 'fraction_numerical': 0.0, 'mean_word_length': 5.472602739726027, '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}}
Specificity and Inheritance in Default Reasoning

When specificity considerations are incorporated in default reasoning systems, it is hard to ensure that exceptional subclasses inherit all legitimate features of their parent classes To reconcile these two requirements specificity and inheritance, this paper proposes the addition of a new rule called coherence rule, to the desiderata for default inference The coherence rule captures the intuition that formulae which are more compatible with the defaults in the database are more believable. We offer a formal definition of this extended desiderata and analyze the behavior of its associated closure relation which we call coference closure. We provide a concrete embodiment of a system satisfying the extended desiderata by taking the coherence closure of system Z A procedure for computing the (unique) most compact, be lief ranking in the coherence closure of system Z is also described.