1. Alsinet, T., Manyà, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proc. of the 6th Int. Conf. on the Theory and Applications of Satisfiability Testing, SAT 2003 (2003)
2. Lecture Notes in Artificial Intelligence;T. Alsinet,2004
3. Lecture Notes in Computer Science;T. Alsinet,2005
4. Lecture Notes in Computer Science;N. Bansal,1999
5. Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proc. of the 19th Int. Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, pp. 193–198. Morgan Kaufmann, San Francisco (2005)