Solving Max-SAT as Weighted CSP

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

Volumn 2833, Issue , 2003, Pages 363-376

  De Givry, Simon ^a   Larrosa, Javier ^b   Meseguer, Pedro ^c   Schiex, Thomas ^a  

^a CEMAGREF   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC;

MAX-SAT PROBLEMS; OVER-CONSTRAINED PROBLEM; PROPOSITIONAL LOGIC; RECENT PROGRESS; SOFT CONSTRAINT; STATE OF THE ART; STATE-OF-THE-ART ALGORITHMS; WEIGHTED CONSTRAINTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33749572862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_25     Document Type: Article

References (27)

1. ALOUL, F., RAMANI, A., MARKOV, I., AND SAKALLAH, K. Pbs: A backtracksearch pseudo-boolean solver and optimizer. In Symposium on the Theory and Applications of Satisfiability Testing (SAT) (Cincinnati, (OH), 2002), pp. 346-353.
2. BARTH, P. A davis-putnam based enumeration algorithm for linear pseudo-boolean optimization. Tech. Rep. MPI-I-95-2-003, Max-Planck Institut Für Informatik, 1995.
3. BORCHERS, B., MITCHELL, J., AND JOY, S. A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT. In Satisfiability Problem: Theory and Applications, D. Du, J. Gu, and P. Pardalos, Eds., vol. 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1997, pp. 519-536.
4. BORNING, A., MAHERT, M., MARTINDALE, A., AND WILSON, M. Constraint hierarchies and logic programming. In Int. conf. on logic programming (1989), pp. 149-164.
5. DIXON, H., AND GINSBERG, M. Inference methods for a pseudo-boolean satisfiability solver. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02) (2002), pp. 635-640.
6. FREUDER, E., AND WALLACE, R. Partial constraint satisfaction. Artificial Intelligence 58 (Dec. 1992), 21-70.
7. th IJCAI (Detroit, MI, 1989), pp. 278-283.
8. GRAMM, J., HIRSCH, E. A., NIEDERMEIER, R., AND ROSSMANITH, P. Now worstcase upper bounds for MAX-2-SAT with application to MAX-CUT. Tech. Rep. TR00-037, Electronic Colloquium on Computational Complexity, 2000.
9. GRAMM, J., AND NIEDERMEIER, R. Faster exact solutions for max2Sat. In Proceedings of the 4th Italian Conference on Algorithms and Complexity (Rome, Italy, Mar. 2000), G. Bongiovanni, G. Gambosi, and R. Petreschi, Eds., vol. 1767 of LNCS, Springer, pp. 174-186.
10. HANSEN, P., AND JAUMARD, B. Algorithms for the maximum satisfiability problem. Computing 44 (1990), 279-303.
11. ILOG. Cplex solver 8.1.0. www.ilog.com/products/cplex, 2002.
12. JOHNSON, D. S., AND TRICK, M. A., Eds. Second DIMACS implementation challenge:cliques, coloring and satisfiability, vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS, 1996.
13. LARROSA, J. On arc and node consistency in weighted CSP. In Proc. AAAI'02 (Edmondton, (CA), 2002).
14. LARROSA, J., AND DECHTER, R. On the dual representation of non-binary semiring-based CSPs. CP'2000 Workshop on Soft Constraints, Oct. 2000.
15. th IJCAI (Acapulco, Mexico, Aug. 2003). see www.inra.fr/bia/T/schiex/Export/ijcai03.pdf.
16. th Design Automation Conference (DAC'01) (June 2001), pp. 530-535.
17. RESENDE, M., PITSOULIS, L., AND PARDALOS, P. Approximate solution of weighted max-SAT problems using GRASP. In Satisfiability problem: Theory and Applications, D. Du, J. Gu, and P. Pardalos, Eds., vol. 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. AMS, 1997, pp. 393-405.
18. ROSENFELD, A., HUMMEL, R., AND ZUCKER, S. Scene labeling by relaxation operations. IEEE Trans. on Systems, Man, and Cybernetics 6, 6 (1976), 173-184.
19. SCHIEX, T. Arc cohérence pour contraintes molles. In Actes de JNPC'00 (Marseille, June 2000).
20. SCHIEX, T. Arc consistency for soft constraints. In Principles and Practice of Constraint Programming - CP 2000 (Singapore, Sept. 2000), vol. 1894 of LNCS, pp. 411-424.
21. th IJCAI (Montréal, Canada, Aug. 1995), pp. 631-637.
22. SELMAN, B., KAUTZ, H., AND COHEN, B. Noise strategies for improving local search. In Proc. of AAAI'94 (Seattle, WA, 1994), pp. 337-343.
23. VAN GELDER, A. Cnfgen formula generator, ftp://dimacs.rutgers.edu/pub/ challenge/satisfiability/contributed/UCSC/instances, 1993.
24. th international conference on logic programming (Paris, France, June 1991).
25. WHITTEMORE, J., KIM, J., AND SAKALLAH, K. SATIRE: A new incremental satisfiability engine. In Proceedings of the 38th conference on Design automation (Las Vegas, NV, June 2001), ACM, pp. 542-545.
26. Xu, H., RUTENBAR, R. A., AND SAKALLAH, K. sub-SAT: A formulation for relaxed boolean satisfiability with applications in routing. In Proc. Int. Symp. on Physical Design (San Diego (CA), Apr. 2002).
27. ZHANG, W. Phase transitions and backbones of 3-SAT and maximum 3-SAT. In Proc. of the γ h International Conference on Principles and Practice of Constraint Programming (CP-01) (Paphos, Cyprus, Nov. 2001), vol. 2239 of LNCS, Springer, pp. 153-167.