An upper bound for minimal resolution refutations

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

Volumn 1584, Issue , 1999, Pages 171-178

  Büning, Hans Kleine ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Length of proofs; Minimal unsatis fiability; Propositional formulas; Resolution

Indexed keywords

OPTICAL RESOLVING POWER;

LENGTH OF PROOFS; MINIMAL UNSATIS-FIABILITY; MINIMAL UNSATISFIABLE FORMULAS; PROPOSITIONAL FORMULAS; RESOLUTION REFUTATION; UPPER BOUND;

COMPUTER CIRCUITS;

EID: 84956984327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_12     Document Type: Conference Paper

References (7)

1. Aharoni, R., Linial, N.: Minimal Non-Two-Colorable Hypergraphs and Minimal Unsatisfiable Formulas. Journal of Combinatorial Theory 43 (1986), 196-204 172, 174, 174, 174
2. Beame, P., Pitassi, T.: Simplified and Improved Resolution Lower Bounds. FOCS 96 (1996) 274-282 171
3. Chvatal, V., Szemeredi, T.: Many hard Exanples for Resolution. Journal of the Association for Computing Maschinery 35 (1988) 759-768 171, 172
4. Davydov, G., Davydova, I., Kleine Buning, H.: An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. to appear in Annals of Mathematics and Artificial Intelligence 173, 174
5. Fu, X.: On the Complexity of Proof Systems. University of Toronto, PhD Thesis, (1995) 171
6. Haken, A.: The intractibility of Resolution. Theoretical Computer Science 39 (1985) 297-308 171
7. Urquhart, A.: Hard Examples for Resolution. Journal of ACM 34 (1987) 209 -219 171