Abstract

We consider the minimal unsatisfiablity problem MU( k) for propositional formulas in conjunctive normal form (CNF) over n variables and n+ k clauses, where k is fixed. k is called the difference. Any formula in MU( k) can be split into two minimal unsatisfiable formula. For such splittings we investigate the size of the differences of the resulting formulas in comparison to the difference of the initial formula. Based on these results we prove that MU( k) for fixed k is in NP, and for MU(2) we present a simple and unique characterization.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.