Citation Context

...ors provide examples of constraints with only super-polynomial size CNF-representations with certain consistency guarantees, even when allowing auxiliary variables; this has been developed further in =-=[30]-=- (see Subsection 9.4). This shows a super-polynomial lower-bound on the worst-case growth, but no method or new (larger) target-class for knowledge-compilation. Another partial answer was given in [2]...