Within-problem learning for efficient lower bound computation in max-SAT solving

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 351-356

  Lin, Han ^a   Su, Kaile ^b,c   Li, Chu Min ^d  

^a SUN YAT SEN UNIVERSITY   (China)

^b Peking University   (China)

^c GRIFFITH UNIVERSITY   (Australia)

^d UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; LEARNING ALGORITHMS;

BEST STATES; BRANCH AND BOUNDS; BRANCH POINTS; COMPUTING METHODS; LEARNING TECHNIQUES; LOWER BOUNDS; NEW TECHNIQUES; SAT SOLVERS; UNIT PROPAGATIONS;

CONTROL THEORY;

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

References (17)

1. Argelich, J., and Manyà, F. 2007. Partial max-sat solvers with clause learning. In SAT-2007, 28-40.
2. Bonet, M.; Levy, J.; and Manyà, F. 2007. Resolution for Max-SAT. Artificial Intelligence 171(8-9):606-618.
3. Darras, S.; Dequen, G.; Devendeville, L.; and Li, C. M. 2007. On inconsistent clause-subsets for max-sat solving. In CP-2007, 225-240.
4. Heras, F.; Larrosa, J.; and Oliveras, A. 2008. Mini-Max SAT: An Efficient Weighted Max-SAT solver. Journal of Artificial Intelligence Research 31:1-32.
5. Larrosa, J., and Heras, F. 2006. New inference rules for efficient max-SAT solving. Proc. of AAAI-06, Boston, MA.
6. Larrosa, J.; Heras, F.; and de Givry, S. 2008. A Logical Approach to Efficient Max-SAT solving. Artificial Intelligence 172(2-3):204-233.
7. Li, C.; Manyà, F.; and Planes, J. 2005. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. In CP-2005, 403-414.
8. Li, C.; Manyà, F.; and Planes, J. 2006. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In AAAI-2006, 86-91.
9. Li, C.; Manyà, F.; and Planes, J. 2007. New Inference Rules for Max-SAT. Journal of Artificial Intelligence Research 30:321-359.
10. Lin, H., and Su, K. 2007. Exploiting inference rules to compute lower bounds for max-sat solving. In IJCAI-2007, 2334-2339.
11. Mneimneh, M.; Lynce, I.; Andraus, Z.; Marques-Silva, J.; and Sakallah, K. 2005. A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. In SAT-2005. Springer.
12. Pipatsrisawat, K., and Darwiche, A. 2007. Clone: Solving weighted max-sat in a reduced search space. In AI-2007, 223-233.
13. Safarpour, S.; Mangassarian, H.; Veneris, A.; Liffiton, M.; and Sakallah, K. 2007. Improved Design Debugging using Maximum Satisfiability. In FMCAD-07.
14. Xing, Z., and Zhang, W. 2005. Max Solver: An efficient exact algorithm for(weighted) maximum satisfiability. Artificial Intelligence 164(1):47-80.
15. Yang, Q.; Wu, K.; and Jiang, Y. 2007. Learning action models from plan examples using weighted MAX-SAT. Artificial Intelligence 171(2-3):107-143.
16. Zhang, L.; Madigan, C. F.; Moskewicz, M. W.; and Malik, S. 2001. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD-2001, 279-285.
17. Zhang, Y.; Zha, H.; Chu, C.; and Ji, X. 2006. Towards Inferring Protein Interactions: Challenges and Solutions. EURASIP Journal on Applied Signal Processing 2006(1):56-56.