The complexity of read-once resolution

Annals of Mathematics and Artificial Intelligence

Volumn 36, Issue 4, 2002, Pages 419-435

  Büning, Hans Kleine ^a   Zhao, Xishun ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Complexity; k resolution; Minimal unsatisfiability; Propositional formulas; Read once resolution

Indexed keywords

EID: 0141455917     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016339119669     Document Type: Article

References (10)

1. R. Aharoni and N. Linial, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, Journal of Combinatorial Theory 43 (1986) 196-204.
2. V. Chvatal and T. Szemeredi, Many hard examples for resolution, Journal of the ACM 35 (1988) 759-768.
3. G. Davydov, 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 (1998) 229-245.
4. A. Haken, The intractability of resolution, Theoretical Computer Science 39 (1985) 297-308.
5. K. Iwama and E. Miyano, Intractability of read-once resolution, in: Proceedings Structure in Complexity Theory, 10th Annual Conference (IEEE, 1995) pp. 29-36.
6. H. Kleine Büning and T. Lettmann, Propositional Logic: Deduction and Algorithm (Cambridge University Press, 1999).
7. H. Kleine Büning and X.S. Zhao, The complexity of some subclasses of minimal unsatisfiable formulas (2000), submitted for publication.
8. O. Kullmann, An application of matroid theory to the SAT problem, Electronic Colloquium on Computational Complexity, Report 18 (2000).
9. C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Science 37 (1988) 2-13.
10. A. Urquhart, Hard examples for resolution, Journal of ACM 34 (1987) 209-219.