{'fraction_non_alphanumeric': 0.01909307875894988, 'fraction_numerical': 0.0, 'mean_word_length': 5.606299212598425, '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}}
Peer-to-Peer Agent Systems for Textual Information Dissemination : Algorithms and Complexity

We discuss the models WP and AWP especially designed for the selective dissemination of textual information by peer-to-peer agent systems. We briefly present the syntax and semantics of these models and concentrate on the complexity of query satisfiability, satisfaction, filtering and entailment (these four problems arise naturally in the intended application domain). Finally we discuss an efficient algorithm for the problem of filtering and evaluate it in a realistic application domain. In previous research we have shown that the problems of satisfaction and filtering can be solved in PTIME but this paper demonstrates that the satisfiability and entailment problems are computationally hard (NPcomplete and coNP-complete respectively).