Detecting disjoint inconsistent subformulas for competing lower bounds for Max-SAT

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 86-91

  Li, Chu Min ^a   Manyà, Felip ^b   Planes, Jordi ^c  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^c UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; COMPUTATION THEORY; PROBLEM SOLVING;

LOWER BOUNDS; ORDERING; SUBFORMULAS;

BOUNDARY VALUE PROBLEMS;

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

References (15)

1. Alsinet, T.; Manyà, F.; and Planes, J. 2004. A Max-SAT solver with lazy data structures. In IBERAMIA 2004, 334-342.
2. Alsinet, T.; Manyà, F.; and Planes, J. 2005. Improved exact solver for weighted Max-SAT. In SAT-2005, 371-377.
3. Borchers, B., and Furman, J. 1999. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization 2:299-306.
4. Larrosa, J., and Heras, F. 2005. Resolution in Max-SAT and its Relation to Local Consistency in Weighted CSPs. In IJCAI-2005, 193-198.
5. de Givry, S.; Larrosa, J.; Meseguer, P.; and Schiex, T. 2003. Solving Max-SAT as weighted CSP. In CP-2003, 363-376.
6. Larrosa, J., and Meseguer, P. 2002. Partition-based lower bound for Max-CSP. Constraints 7(3-4):407-419.
7. Larrosa, J.; Meseguer, P.; and Schiex, T. 1999. Maintaining reversible DAC for Max-CSP. Artificial Intelligence 107(1):149-163.
8. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In IJCAI'97, 366-371.
9. Li, C. M.; 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.
10. Shen, H., and Zhang, H. 2004. Study of lower bound functions for max-2-sat. In AAAI-2004, 185-190.
11. Shen, H., and Zhang, H. 2005. Improving exact algorithms for max-2-sat. Annals of Mathematics and Artificial Intelligence 44:419-436.
12. Wallace, R., and Freuder, E. 1996. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. Cliques, Coloring and Satisfiability, volume 26, 587-615.
13. Wallace, R. J. 1995. Directed arc consistency preprocessing. In Springer LNCS 923, 121-137.
14. Xing, Z., and Zhang, W 2004. Efficient strategies for (weighted) maximum satisfiability. In CP-2004, 690-705.
15. Xing, Z., and Zhang, W. 2005. An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164(2):47-80.