Exact Max-SAT solvers for over-constrained problems

• Alber, J., J. Gramm, and R. Niedermeier. (1998). “Faster Exact Algorithms for Hard Problems: A Parameterized Point of View.” In 25th Conf. on Current Trends in Theory and Practice of Informatics, LNCS, Springer-Verlag, pp. 168–185.

• Alsinet, T., F. Manyà, and J. Planes. (2003). “Improved Branch and Bound Algorithms for Max-SAT.” In Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing.

• Borchers, B. and J. Furman. (1999). “A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems.” Journal of Combinatorial Optimization 2, 299–306.

  Article  MathSciNet  Google Scholar 

• Cha, B., K. Iwama, Y. Kambayashi, and S. Miyazaki. (1997). “Local Search Algorithms for Partial MAXSAT.” In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, AAAI Press, pp. 263–268.

• Culberson, J. (1995). “Graph Coloring Page: The Flat Graph Generator.” See http://web.cs.ualberta.ca/˜joe/ Coloring/Generators/flat.html.

• Davis, M., G. Logemann, and D. Loveland. (1962). “A Machine Program for Theorem-Proving.” Communications of the ACM 5, 394–397.

  Article  MathSciNet  Google Scholar 

• de Givry, S., J. Larrosa, P. Meseguer, and T. Schiex. (2003). “Solving Max-SAT as Weighted CSP.” In 9th International Conference on Principles and Practice of Constraint Programming, CP-2003, Kinsale, Ireland, Springer LNCS 2833, pp. 363–376.

• Gent, I. P. (2002). “Arc Consistency in SAT.” In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), Lyon, France, pp. 121–125.

• Gomes, C. P. and B. Selman. (1997). “Problem Structure in the Presence of Perturbations.” In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, AAAI Press, pp. 221–226.

• Hwang, J. and D. G. Mitchell. (2005). “2-way vs. d-way Branching for CSP.” In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, Springer LNCS 3709, pp. 343–357.

• Jiang, Y., H. Kautz, and B. Selman. (1995). “Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for Max-SAT.” In Proceedings of the 1st International Workshop on Artificial Intelligence and Operations Research.

• Kasif, S. (1990). “On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks.” Artificial Intelligence 45, 275–286.

  Article  MATH  MathSciNet  Google Scholar 

• Larrosa, J. and P. Meseguer. (1999). “Partition-based Lower Bound for Max-CSP.” In 5th International Conference on Principles and Practice of Constraint Programming, CP'99, Alexandria, USA, Springer LNCS 1713, pp. 303–315.

• Larrosa, J. and T. Schiex. (2003). “In the Quest of the Best form of Local Consistency for Weighted CSP.” In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'03, Acapulco, México, pp. 239–244.

• Li, C. M., F. Manyà, and J. Planes. (2005). “Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.” In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, Springer LNCS 3709, pp. 403–414.

• Loveland, D. W. (1978). Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland.

• Meseguer, P., N. Bouhmala, T. Bouzoubaa, M. Irgens, and M. Sánchez. (2003). “Current Approaches for Solving Over-Constrained Problems.” Constraints 8(1), 9–39.

  Article  MathSciNet  Google Scholar 

• Moskewicz, M., C. Madigan, Y. Zhao, L. Zhang, and S. Malik. (2001). “Chaff: Engineering an Efficient Sat Solver.” In 39th Design Automation Conference.

• Selman, B., H. Levesque, and D. Mitchell. (1992). “A New Method for Solving Hard Satisfiability Problems.” In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92, San Jose/CA, USA, AAAI Press, pp. 440–446.

• Smith, B. and M. Dyer. (1996). “Locating the Phase Transition in Binary Constraint Satisfaction Problems.” Artificial Intelligence 81, 155–181.

  Article  MathSciNet  Google Scholar 

• Wallace, R. and E. Freuder. (1996). “Comparative Studies of Constraint Satisfaction and Davis-Putnam Algorithms for Maximum Satisfiability Problems.” In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, volume 26, pp. 587–615.

• Xing, Z. and W. Zhang. (2005). “MaxSolver: An Efficient Exact Algorithm for (Weighted) Maximum Satisfiability.” Artificial Intelligence 164(1-2), 47–80.

  Article  MathSciNet  Google Scholar 

• Zhang, H., H. Shen, and F. Manya. (2003). “Exact Algorithms for Max-SAT.” In 4th Int. Workshop on First order Theorem Proving, June.

Download references