Minimum witnesses for unsatisfiable 2CNFs

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

Volumn 4121 LNCS, Issue , 2006, Pages 42-47

  Buresh Oppenheim, Joshua ^a   Mitchell, David ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

DYNAMIC PROGRAMMING ALGORITHMS; IMPLICATION GRAPH; RESOLUTION REFUTATIONS;

PROBLEM SOLVING;

EID: 33749546107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_6     Document Type: Conference Paper

References (4)

1. A. Alekhnovich, S. Buss, S. Moran, and T. Pitassi. Minimal prepositional proof length is NP-hard to linearly approximate. In Proc., MFCS'98, pages 176-184, 1998.
2. (Also LNCS 1450).
3. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8(3):121-123, March 1979.
4. K. Subramani. Optimal length tree-like resolution refutations for 2SAT formulas. ACM Transactions on Computational Logic, 5(2):316-320, April 2004.