Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: While it was known that all models of a Horn formula can be generated in outputpolynomial time, here  present an explicit algorithm as opposed to the rather vague oracle-scheme suggested in the proof of [6, Thm.4]. It is an instance of some principle of exclusion that compactly (thus not one by one) generates all models of certain Boolean formulae given in CNF. The principle of exclusion can be adapted to generate only the models of ight k.  compare and contrast it with constraint programming, 0; 1 integer programming, and binary decision diagrams.
['Marcel Wild']
I am writing a research paper on a idea Compactly Generating All Satisfying Truth Assignments of a Horn Formula
[{"from": "human", "value": "I am writing a research paper on a idea Compactly Generating All Satisfying Truth Assignments of a Horn Formula"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: While it was known that all models of a Horn formula can be generated in outputpolynomial time, here  present an explicit algorithm as opposed to the rather vague oracle-scheme suggested in the proof of [6, Thm.4]. It is an instance of some principle of exclusion that compactly (thus not one by one) generates all models of certain Boolean formulae given in CNF. The principle of exclusion can be adapted to generate only the models of ight k.  compare and contrast it with constraint programming, 0; 1 integer programming, and binary decision diagrams."}]