Generating clause sequences of a CNF formula

Given a CNF formula Φ with clauses C₁,…,C_m and variables V={x₁,…,x_n}, a truth assignment a:V→{0,1} of Φ leads to a clause sequence σ_Φ(a)=(C₁(a),…,C_m(a))∈{0,1}^m where C_i(a)=1 if clause C_i evaluates to 1 under assignment a, otherwise C_i(a)=0. The set of all possible clause sequences carries a lot of information on the formula, e.g. SAT, MAX-SAT and MIN-SAT can be encoded in terms of finding a clause sequence with extremal properties. We consider a problem posed at Dagstuhl Seminar 19211 “Enumeration in Data Management” (2019) about the generation of all possible clause sequences of a given CNF with bounded dimension. We prove that the problem can be solved in incremental polynomial time. We further give an algorithm with polynomial delay for the class of tractable CNF formulas. We also consider the generation of maximal and minimal clause sequences, and show that generating maximal clause sequences is NP-hard, while minimal clause sequences can be generated with polynomial delay.