Optimal length tree-like resolution refutations for 2SAT formulas

ACM Transactions on Computational Logic

Volumn 5, Issue 2, 2004, Pages 316-320

  Subramani, K ^a  

^a WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

2SAT formulas; Resolution; Tree like proofs

Indexed keywords

2SAT FORMULAS; RESOLUTIONS; TAUTOLOGIES; TREE-LIKE PROOFS;

ALGORITHMS; DATABASE SYSTEMS; FORMAL LANGUAGES; FORMAL LOGIC; LOGIC DESIGN; POLYNOMIALS; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY;

EID: 4444314501     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/976706.976711     Document Type: Article

References (16)

1. ACHLIOPTAS, D., BEAME, P., AND MOLLOY, M. 2001. A sharp threshold in proof complexity. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM, New York, 337-346.
2. ALEKHNOVICH, M., BUSS, S., MORAN, S., AND PITASSI, T. 1998. Minimum prepositional proof length is NP-hard to linearly approximate. In Proceedings of the Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, Springer-Verlag, New York.
3. ASPVALL, B., PLASS, M. F., AND TARJAN, R. 1979. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Proc. Lett. 3.
4. BEAME, P. AND PITASSI, T. 1996. Simplified and improved resolution lower bounds. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (Burlington, Vt.). IEEE Computer Society Press, Los Alatmitos, Calif., 274-282.
5. BEAME, P. AND PITASSI, T. 1998. Propositional proof complexity: Past, present, future. Bull. EATCS 65, 66-89.
6. BEN-SASSON, E. AND WIGDERSON, A. 2001. Short proofs are narrow-resolution made simple. J. ACM 48.
7. BESTAVROS, A. AND FAY-WOLFE, V., EDS. 1997. Real-Time Database and Information Systems, Research Advances. Kluwer Academic Publishers.
8. BOCKMAYR, A. AND EISNBRAND, F. 2000. Combining logic and optimization in cutting plane theory: In Proceedings of Frontiers of Combining Systems (FROCOS) 2000. Lecture Notes in Artificial Intelligence. Springer-Verlag, New York, 1-17.
9. CLEGG, M., EDMONDS, J., AND IMPAGLIAZZO, R. 1996. Using the Groebner basis algorithm to find proofs of unsatisfiability. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pa.). ACM, New York, 174-183.
10. COOK, S. A. AND RECKHOW, R. A. 1973. Time bounded random access machines. J. Comput. Syst. Sci. 7, 4 (Aug.), 354-375.
11. HAKEN, A. 1985. The intractability of resolution. Theoret. Comput. Sci. 39, 2-3 (Aug.), 297-308.
12. IWAMA, K. 1997. Complexity of finding short resolution proofs. In Mathematical Foundations of Computer Science, 1995. Lecture Notes in Computer Science, vol. 1295. Springer-Verlag, New York, 309-319.
13. IWAMA, K. AND MIYANO, E. 1995. Intractability of read-once resolution. In Proceedings of the 10th Annual Conference on Structure in Complexity Theory (SCTC '95). IEEE Computer Society Press, Los Alamitos, Calif., 29-36.
14. PUDLÁK, P. 1997. Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Logic 62, 3 (Sept.), 981-998.
15. RAZBOROV, A. A. 1996. Lower bounds for propositional proofs and independence results in bounded arithmetic. In Automata, Languages and Programming, 23rd International Colloquium, F. M. auf der Heide and B. Monien, Eds. Lecture Notes in Computer Science, vol. 1099. Springer-Verlag, Paderborn, Germany, 48-62.
16. URQUHART, A. 1995. The complexity of propositional proofs. Bull. Symb. Logic 1, 4 (Dec.), 425-467.