On Some Aspects of Mixed Horn Formulas

Simple but Hard Mixed Horn Formulas

“…Researchers proved that many NP-complete problems have simple encodings as MHFs [2], showed that the satisfiability of MHFs remains NP-compete even under additional restrictions of the structure of input MHFs [2], and developed satisfiability algorithms for MHFs with good worst-case behavior lower bounds [1,3].…”