Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Papadimitriou, M. Yannakakis (1982)
The complexity of facets (and some facets of complexity)
Martin Davis, H. Putnam (1960)
A Computing Procedure for Quantification TheoryJ. ACM, 7
(1996)
Solvable matrices
C.H. Papadimitriou, D. Wolfe (1988)
The complexity of facets resolvedJournal of Computer and System Sciences, 37
G. Davydov, I. Davydova (1993)
Solvable matrices, Vestnik St. Petersburg UniversityMathematics, 26
C. Papadimitriou, David Wolfe (1985)
The complexity of facets resolved26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
W. Dowling, J. Gallier (1984)
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn FormulaeJ. Log. Program., 1
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 17, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.