Abstract
We consider the minimal unsatisfiability problem for propositional formulas over n variables with n+k clauses for fixedk. We will show that in case of at most n clauses no formula is minimal unsatisfiable. For n+1 clauses the minimal unsatisfiability problem is solvable in quadratic time. Further, we present a characterization of minimal unsatisfiable formulas with n+1clauses in terms of a certain form of matrices.
Similar content being viewed by others
References
M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of ACM 7 (1960) 201–215.
G. Davydov and I. Davydova, Solvable matrices, Vestnik St. Petersburg University, Mathematics 26(1) (1993) 1–6 (see also Mathematical Reviews (1996)).
W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1 (1984) 267–284.
C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences 37 (1988) 2–13.
C.H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), Journal of Computer and System Sciences 28 (1984) 244–259.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Davydov, G., Davydova, I. & Büning, H.K. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence 23, 229–245 (1998). https://doi.org/10.1023/A:1018924526592
Issue Date:
DOI: https://doi.org/10.1023/A:1018924526592