New bounds for MAX-SAT by glause learning

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

Volumn 4649 LNCS, Issue , 2007, Pages 194-204

  Kulikov, Alexander S ^a   Kutzkov, Konstantin ^b  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; LEARNING ALGORITHMS; LEARNING SYSTEMS; THEOREM PROVING;

GLAUSE LEARNING; MAX-SAT; POLYNOMIAL SPACE; SPLITTING ALGORITHM;

PROBLEM SOLVING;

EID: 37249068927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74510-5_21     Document Type: Conference Paper

References (18)

1. Williams, R.: On computing k-CNF formula properties. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 330-340. Springer, Heidelberg (2004)
2. Robson, J.: Algorithms for maximum independent sets. Journal of Algorithms 7(3), 425-440 (1986)
3. Marques-Silva, J., Sakallah, K.: Grasp: a search algorithm for propositional satisfiability. IEEE Transactionon Computers 48(5), 506-521 (1999)
4. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, pp. 530-535 (2001)
5. Zhang, H.: Sato: An efficient propositional prover. In: McCune, W. (ed.) Automated Deduction - CADE-14. LNCS, vol. 1249, pp. 272-275. Springer, Heidelberg (1997)
6. Beame, P., Impagliazzo, R., Pitassi, T., Segerlind, N.: Memoization and DPLL: formula caching proof systems. In: Proceedings of 18th IEEE Annual Conference on Computational Complexity, pp. 248-259. IEEE Computer Society Press, Los Alamitos (2003)
7. n) time. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 266-276. Springer, Heidelberg (2006)
8. Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348, 357-365 (2005)
9. Niedermeier, R., Rossmanith, P.: New upper bounds for MaxSat. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 575-585. Springer, Heidelberg (1999)
10. k/4-time algorithm for MAX-2-SAT: Corrected version. ECCC Report TR99-036, Revision 02 (2000)
11. Gramm, J., Hirsch, E.A., Niedermeier, R., Rossmanith, P.: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130(2), 139-155 (2003)
12. Scott, A., Sorkin, G.: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 382395. Springer, Heidelberg (2003)
13. Kneis, J., Rossmanith, P.: A new satisfiability algorithm with applications to MaxCut. Technical Report AIB2005-08, Dept. of Computer Science, RWTH Aachen University (2005)
14. Kojevnikov, A., Kulikov, A.S.: A new approach to proving upper bounds for MAX2-SAT. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11-17. ACM Press, New York (2006)
15. Kneis, J., Moelle, D., Richter, S., Rossmanith, P.: Algorithms based on the treewidth of sparse graphs. In: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science. LNCS, pp. 385-396 (2005)
16. Scott, A.D., Sorkin, G.B.: Linear-programming design and analysis of fast algorithms for Max 2-SAT and Max 2-CSP. Discrete Optimization 2006 (to appear)
17. Kullmann, O., Luckhardt, H.: Algorithms for SAT/TAUT decision based on various measures. Preprint (1998)
18. Kulikov, A.S.: Automated generation of simplification rules for SAT and MAXSAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 430-436. Springer, Heidelberg (2005)