A complete calculus for max-SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 240-251

  Bonet, María Luisa ^a   Levy, Jordi ^b   Manyà, Felip ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; OPTIMIZATION; THEOREM PROVING;

CALCULUS; COMPLETENESS; TIME UPPER BOUND;

PROBLEM SOLVING;

EID: 33749539713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_24     Document Type: Conference Paper

References (14)

1. T. Alsinet, F. Manyà, and J. Planes. Improved branch and bound algorithms for Max-SAT. In Proc. of the 6th Int. Conf. on the Theory and Applications of Satisfiability Testing, SAT'03, 2003.
2. T. Alsinet, F. Manyà, and J. Planes. A Max-SAT solver with lazy data structures. In Proc. of the 9th Ibero-American Conference on Artificial Intelligence, IBERAMIA'04, number 3315 in LNCS, pages 334-342, Puebla, México, 2004. Springer.
3. T. Alsinet, F. Manyà, and J. Planes. Improved exact solver for weighted Max-SAT. In Proc. of the 8th Int. Conf. on Theory and Applications of Satisfiability Testing, SAT'05, number 3569 in LNCS, pages 371-377, St. Andrews, Scotland, 2005. Springer.
4. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proc. of the 10th Int. Symposium on Algorithms and Computation, ISAAC'99, number 1741 in LNCS, pages 247-260, Chennai, India, 1999. Springer.
5. J. Larrosa and F. Heras. 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'05, pages 193-198, Edinburgh, Scotland, 2005. Morgan Kaufmann.
6. C. M. Li, F. Manyà, and J. Planes. Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In Proc. of the 11th Int. Conf. on Principles and Practice of Constraint Programming, CP'05, number 3709 in LNCS, pages 403-414, Sitges, Spain, 2005. Springer.
7. C. M. Li, F. Manyà, and J. Planes. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In Proc. of the 21st National Conference on Artificial Intelligence, AAAI'06, Boston, USA, 2006.
8. R. Niedermeier and P. Rossmanith. New upper bounds for maximum satisfiability. Journal of Algorithms, 36(1):63-88, 2000.
9. H. Shen and H. Zhang. Study of lower bound functions for MAX-2-SAT. In Proc. of the 19th National Conference on Artificial Intelligence, AAAI'04, pages 185-190, San Jose, California, USA, 2004.
10. H. Shen and H. Zhang. Improving exact algorithms for MAX-2-SAT. Annals of Mathematics and Artificial Intelligence, 44(4):419-436, 2005.
11. Z. Xing and W. Zhang. Efficient strategies for (weighted) maximum satisfiability. In Proc. of the 10th Int. Conf. on Principles and Practice of Constraint Programming, CP'04, number 3258 in LNCS, pages 690-705, Toronto, Canada, 2004. Springer.
12. Z. Xing and W. Zhang. An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence, 164(2):47-80, 2005.
13. H. Zhang, H. Shen, and F. Manya. Exact algorithms for Max-SAT. In 4th Int. Workshop on First-Order Theorem Proving, FTP'03, Valencia, Spain, 2003.
14. H. Zhang, H. Shen, and F. Manya. Exact algorithms for Max-SAT. Electronic Notes in Theoretical Computer Science, 86(1), 2003.