{'fraction_non_alphanumeric': 0.020253164556962026, 'fraction_numerical': 0.0, 'mean_word_length': 6.0625, '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}}
Solving satisfiability problems with membrane algorithms

This paper presents the application of membrane algorithms to satisfiability problems which are well-known NP-hard combinatorial optimization problems. The membrane algorithm, called QEPS, is a combination of P system approaches and quantum-inspired evolutionary algorithms. QEPS employs the hierarchical structure of the compartments of P systems, the objects consisting of quantum-inspired bit individuals, the rules composed of quantum-inspired gate evolutionary rules and transformation/communication-like rules in P systems to specify the membrane algorithms. A large number of experiments carried out on bench satisfiability problems show that QEPS performs better than its counterpart quantum-inspired evolutionary algorithm.