Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A backbone of a propositional CNF formula is a variable whose truth value is the same in every truth assignment that satisfies the formula. The notion of backbones for CNF formulas has been studied in various contexts. ,  introduce local variants of backbones, and study the computational complexity of detecting them. In particular,  consider k- backbones, which are backbones for sub-formulas consisting of at most k clauses, and iterative k- backbones, which are backbones that result after repeated instantiations of k- backbones.  determine the parameterized complexity of deciding whether a variable is a k- backbone or an iterative k- backbone for various restricted formula classes, including Horn, definite Horn, and Krom.  also present some first empirical results regarding backbones for CNF-Satisfiability (SAT). The empirical results  obtain show that a large fraction of the backbones of structured SAT instances are local, in contrast to random instances, which appear to have few local backbones.
['Ronald de Haan', 'Iyad A. Kanj', 'Stefan Szeider']
I am writing a research paper on a idea Local backbones
[{"from": "human", "value": "I am writing a research paper on a idea Local backbones"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A backbone of a propositional CNF formula is a variable whose truth value is the same in every truth assignment that satisfies the formula. The notion of backbones for CNF formulas has been studied in various contexts. ,  introduce local variants of backbones, and study the computational complexity of detecting them. In particular,  consider k- backbones, which are backbones for sub-formulas consisting of at most k clauses, and iterative k- backbones, which are backbones that result after repeated instantiations of k- backbones.  determine the parameterized complexity of deciding whether a variable is a k- backbone or an iterative k- backbone for various restricted formula classes, including Horn, definite Horn, and Krom.  also present some first empirical results regarding backbones for CNF-Satisfiability (SAT). The empirical results  obtain show that a large fraction of the backbones of structured SAT instances are local, in contrast to random instances, which appear to have few local backbones."}]