|
Papers and articles related to RSat
- Pipatsrisawat, K. and Darwiche, A. A New Clause Learning Scheme for Efficient Unsatisfiability Proofs. To appear in Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08). [bib]
- Pipatsrisawat, K. and Darwiche, A. A Lightweight Component Caching Scheme for Satisfiability Solvers. In proceedings of Tenth International Conference on
Theory and Applications of Satisfiability Testing (SAT'07), Lisbon, Portugal, May 2007.[bib]
- Darwiche, A. New Advances in Compiling CNF to Decomposable Negational Normal Form. Proceedings of European Conference on Artificial Intelligence, pp. 328-332, 2004. [bib]
- Pipatsrisawat, K. and Darwiche, A. RSat 2.0: SAT Solver Description. Technical report D153. Automated Reasoning Group, Computer Science Department, University of California, Los Angeles. 2007.[bib]
Please reference this report if you use either RSat 2.02, 2.01 or 2.00 in your work.
- Pipatsrisawat, K. and Darwiche, A. RSat 1.03: SAT Solver Description. Technical report D152. Automated Reasoning Group, Computer Science Department, University of California, Los Angeles. 2006.[bib]
Please reference this report if you use RSat 1.03 in your work.
Related papers by others
- The Effect of Restarts on the Efficiency of Clause Learning by Jinbo Huang.
You may want to visit the publication page of our group to see other publications.
|