An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of ACM 7 (1960) 201–215. CrossRef
- 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. CrossRef
- C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences 37 (1988) 2–13. CrossRef
- 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. CrossRef
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
Volume 23, Issue 3-4 , pp 229-245
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Faculty of Math.–Mech., Institute of Transport Problems, Russian Academy of Sciences, P.O. Box 20, 199053, St. Petersburg, Russia
- 2. Department of Mathematics and Computer Science, University of Paderborn, D-33095, Paderborn, Germany