Clause-learning algorithms with many restarts and bounded-width resolution

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

Volumn 5584 LNCS, Issue , 2009, Pages 114-127

  Atserias, Albert ^a   Fichte, Johannes Klaus ^b   Thurley, Marc ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CNF FORMULAS; NON-DETERMINISM; RESOLUTION REFUTATION; THEORETICAL RESULT; UPPER BOUND;

LEARNING ALGORITHMS;

EID: 70350650141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_13     Document Type: Conference Paper

References (16)

1. Alekhnovich, M., Razborov, A.A.: Satisfiability, branch-width and tseitin tautologies. In: FOCS, pp. 593-603. IEEE Computer Society Press, Los Alamitos (2002)
2. Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323-334 (2008)
3. Beame, P., Kautz, H.A., Sabharwal, A.: Understanding the power of clause learning. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1194-1201. Morgan Kaufmann, San Francisco (2003)
4. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res (JAIR) 22, 319-351 (2004)
5. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. In: STOC, pp. 517-526 (1999)
6. Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310-326. Springer, Heidelberg (2002)
7. Eeń, N., Sörensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
8. Goldberg, E., Novikov, Y.: Berkmin: A fast and robust sat-solver. In: Design, Automation and Test in Europe, DATE 2002 (2002)
9. Hertel, P., Bacchus, F., Pitassi, T., Van Gelder, A.: Clause learning can effectively p-simulate general propositional resolution. In: Fox, D., Gomes, C.P. (eds.) AAAI, pp. 283-290. AAAI Press, Menlo Park (2008)
10. Bayardo Jr., R.J., Schrag, R.C.: Using csp look-back techniques to solve real-world sat instances. In: Proceedings of the Fourtheenth National Conference on Artificial Intelligence (AAAI 1997), pp. 203-208 (1997)
11. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an effcient sat solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (June 2001)
12. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937-977 (2006)
13. Pipatsrisawat, K., Darwiche, A.: Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA (2007)
14. Ryan, L.: Effcient algorithms for clause-learning sat solvers. Master's thesis, Simon Fraser University (2004)
15. Marques Silva, J.P., Sakallah, K.A.: Grasp - a new search algorithm for satisfiability. In: Proceedings of IEEE/ACM International Conference on Computer-Aided Design, November 1996, pp. 220-227 (1996)
16. Urquhart, A.: Hard examples for resolution. J. ACM 34(1), 209-219 (1987)