On the structure of some classes of minimal unsatisfiable formulas

Authors:
Hans Kleine Büning;Xishun Zhao
Affiliations:
Department of Mathematics and Computer Science, University of Paderborn, D-33095 Paderborn, Germany;Institute of Logic and Cognition, Zhongshan University, Guangzhou 510275, People's Republic of China
Venue:
Discrete Applied Mathematics - The renesse issue on satisfiability
Year:
2003

Citing 10
Cited 5

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas

Journal of Combinatorial Theory Series A
Hard examples for resolution

Journal of the ACM (JACM)
Many hard examples for resolution

Journal of the ACM (JACM)
The complexity of facets resolved

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
CNF satisfiability test by counting and polynomial average time

SIAM Journal on Computing
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
On subclasses of minimal unsatisfiable formulas

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

Annals of Mathematics and Artificial Intelligence
An Application of Matroid Theory to the SAT Problem

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity

Computing unsatisfiable k-SAT instances with few occurrences per variable

Theoretical Computer Science
Polynomial time SAT decision, hypergraph transversals and the hermitian rank

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The local lemma is tight for SAT

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Minimal false quantified boolean formulas

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate classes of minimal unsatisfiable formulas which are closed under splitting. For marginal formulas the equivalence to some natural classes of formulas is proved. Further, we show that maximal formulas are closely related to the so-called hitting formulas. That are formulas for which any two clauses contain a pair of complementary literals.