{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.0030303030303030303, 'mean_word_length': 5.15527950310559, '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}}
An Almost Quadratic Class of Satisfiability Problems

Many reasoning problems in Knowledge Representation can be reduced to the satisfiability problem of propositional logic. Since Cook proved that satisfiability is NP-Complete, several classes of propositional formulas have been identified for which satisfiability is polynomially solvable. These polynomial classes form the basis of several tractable knowledge representation systems, for example, those based on Horn clauses. In this paper, we present a new class Quad of formulas for which satisfiability is solvable in O(n2k) time, where n is the size of the formula and k is the size of the longest clause in the formula. Formulas in class Quad can be also recognized inO(n2k) time. Thus, for any restriction on satisfiability that forces a fixed upper bound on clause length, for example, 3-SAT, the restricted class Quad is recognizable and solvable in quadratic time. The class Quad strictly contains all Horn and binary formulas.