On Approximate Horn Formula Minimization

The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability result is proven, which is the first inapproximability result for this problem. We also consider several other versions of Horn minimization. The more general version which

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán
• Keywords: Horn Formula, Horn Minimization, ICALP 2010, Minimization Problem, Programming Languages