{'fraction_non_alphanumeric': 0.017214397496087636, 'fraction_numerical': 0.0, 'mean_word_length': 5.7368421052631575, '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}}
Protocols for efficient inference communication

Semantic approaches are increasingly applied to large-scale computing tasks. Nodes in such systems will need to exchange large volumes of declarative information, including ontologies and logical theories. In this paper, we describe our initial work on a system for compressed two-way communication of simplified logical inferences. This new system simplifies protocols for semantic data compression from our prior work, reducing seemingly different operations to hypergraph partitioning. We also present a new protocol that achieves significant speedup, at the cost of reduced compression.