A new clause learning scheme for efficient unsatisfiability proofs

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1481-1484

  Pipatsrisawat, Knot ^a   Darwiche, Adnan ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIONICS; BOOLEAN FUNCTIONS;

CLAUSE LEARNINGS; NEW CLASSES; SAT SOLVERS; UNSATISFIABILITY;

ARTIFICIAL INTELLIGENCE;

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

References (10)

1. Andrews, P. B. 1968. Resolution with merging. J. ACM 15(3):367-381.
2. del Val, A. 1994. Tractable databases: How to make propositional unit resolution complete through compilation. In Proceedings ofKR-94, pp. 551-561.
3. Dershowitz, N.; Hanna, Z.; and Nadel, A. 2007. Towards a better understanding of the functionality of a conflict-driven sat solver. In SAT, 287-293.
4. Eén, N., and Sörensson, N. 2003. An extensible sat-solver. In Proceedings of SAT 2003.
5. Marques-Silva, J. P., and Sakallah, K. A. 1996. GRASP -A New Search Algorithm for Satisfiability. In Proceedings of IEEE/ACM Intl. Conf. on CAD, 220-227.
6. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient sat solver. In Proceedings ofDAC'01, June 2001.
7. Pipatsrisawat, K., and Darwiche, A. 2007. Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Comp. Sci. Department, UCLA.
8. Pipatsrisawat, K., and Darwiche, A. 2008. A new clause learning scheme for efficient unsatisfiability proofs. Technical Report D-156, Automated Reasoning Group, Comp. Sci. Department, UCLA.
9. Ryan, L. 2004. Efficient Algorithms for Clause-Learning SAT Solvers. Master's thesis, Simon Fraser University.
10. Zhang, L.; Madigan, C. F; Moskewicz, M. W.; and Malik, S. 2001. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD-01, 279-285.