NP-completeness of refutability by literal-once resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2083 LNAI, Issue , 2001, Pages 168-181

  Szeider, Stefan ^a  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SEMANTICS;

BOOLEAN FORMULAE; CNF FORMULAS; CONJUNCTIVE NORMAL FORMS; NP COMPLETE; NP-COMPLETENESS; POLYNOMIAL-TIME; REFUTABILITY; RESOLUTION REFUTATION;

BOOLEAN ALGEBRA;

EID: 84867827326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_13     Document Type: Conference Paper

References (14)

1. R. Aharoni and N. Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A, 43:196-204, 1986.
2. J. Bang-Jensen and G. Gutin. Digraphs: theory, algorithms, applications. Springer Monographs in Mathematics. Springer Verlag, 2000.
3. W. Bibel. On matrices with connections. Journal of the ACM, 28(4):633-645, 1981.
4. G. Davidov, I. Davydova, and H. Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 23:229-245, 1998.
5. H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Submitted, 2000.
6. Z. Galil. On the complexity of regular resolution and the Davis and Putnam procedure. Theoretical Computer Science, 4:23-46, 1977.
7. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
8. K. Iwama and E. Miyano. Intractability of read-once resolution. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pages 29-36, Minneapolis, Minnesota, 1995. IEEE Computer Society Press.
9. H. Kleine Büning. On subclasses of minimal unsatisfiable formulas. To appear in Discr. Appl. Math., 2001.
10. H. Kleine Büning and T. Lettman. Propositional logic: deduction and algorithms. Cambridge University Press, Cambridge, 1999.
11. O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference of Computational Complexity, pages 116-124, 2000.
12. C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. J. Comput. Syst. Sci., 37(1):2-13, 1988.
13. D. Prawitz. Advances and problems in mechanical proof procedures. In Machine Intelligence, volume 4, pages 59-71. American Elsevier, New York, 1969.
14. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.