{'fraction_non_alphanumeric': 0.014669926650366748, 'fraction_numerical': 0.0, 'mean_word_length': 5.448818897637795, '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}}
Parallelism in Inheritance Hierarchies with Exceptions

In a recent paper, Etherington & Reiter formalized a simple version of semantic networks with exceptions in terms of Reiter's Default Logic. With this approach they were able to formally characterize the correctness of an inference algorithm in terms of Default Logic, and exhibited an algorithm that was correct in this sense. Finally, they concluded that massively parallel architectures for semantic networks, such as NETL apparently cannot implement this algorithm. In this paper, we present a different massively parallel architecture for the simplified semantic networks outlined in their paper which appears to avoid the objections to NETL. We also present some results of simulations in this framework of the examples presented in Etherington and Reiter.