Clause learning can effectively p-simulate general propositional resolution

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 283-290

  Hertel, Philipp ^a   Bacchus, Fahiem ^a   Pitassi, Toniann ^a   Gelder, Allen Van ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; ARTIFICIAL INTELLIGENCE; BIONICS; EDUCATION;

APPLICATION AREAS; CLAUSE LEARNINGS; PROOF SYSTEMS; PROPOSITIONAL RESOLUTIONS; REAL WORLDS; SAT SOLVERS;

LEARNING ALGORITHMS;

EID: 57749186649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Alekhnovich, M., and Razborov, A. A. 2001. Resolution is Not Automatizable Unless W[P] is Tractable. In FOCS, 210-219.
2. Alekhnovich, M.; Johannsen, J.; Pitassi, T.; and Urquhart, A. 2002. An Exponential Separation Between Regular And General Resolution. STOC 448 - 456.
3. Bayardo, R. J. J., and Schrag, R. C. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), 203-208.
4. Beame, P.; Kautz, H.; and Sabharwal, A. 2004. Towards Understanding and Harnessing the Potential of Clause Learning. JAIR 22:319 - 351.
5. Bonet, M. L.; Pitassi, T.; and Raz, R. 2000. On interpolation and automatization for Frege systems. SIAM Journal on Computing 29(6): 1939-1967.
6. Buresh-Oppenheim, J., and Pitassi, T. 2003. The Complexity of Resolution Refinements. LICS 138 - 147.
7. Cook, S., and Reckhow, R. A. 1979. The Relative Efficiency of Propositional Proof Systems. The Journal of Symbolic Logic 44:36 - 50.
8. Davis, M.; Logemann, G.; and Loveland, D. 1962. A Machine Program For Theorem Proving. Communications of the ACM 5:394 -397.
9. Hertel, A.; Hertel, P.; and Urquhart, A. 2007. Formalizing dangerous sat encodings. In SAT, 159-172.
10. Hertel, P. 2008. Ph.D. Thesis. Ph.D. Dissertation, Department of Computer Science, University of Toronto.
11. Marques-Silva, J. P., and Sakallah, K. A. 1996. GRASP - A New Search Algorithm for Satisfiability. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, 220-227.
12. Stallman, R., and Sussman, G. J. 1977. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9:135-196.
13. Urquhart, A. 2008. Regular and general resolution: An improved separation. In SAT, 277-290.
14. Van Gelder, A. 2005a. Input distance and lower bounds for propositional resolution proof length. In SAT.
15. Van Gelder, A. 2005b. Pool resolution and its relation to regular resolution and DPLL with clause learning. In LPAR, 580-594.