On inconsistent clause-subsets for max-SAT solving

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

Volumn 4741 LNCS, Issue , 2007, Pages 225-240

  Darras, Sylvain ^a   Dequen, Gilles ^a   Devendeville, Laure ^a   Li, Chu Min ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Inconsistent subset; Max SAT; Unit propagation

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; SET THEORY; TREES (MATHEMATICS);

INCONSISTENT SUBSETS; MEMORIZED SUBSETS; UNIT PROPAGATION;

PROBLEM SOLVING;

EID: 38149067474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_18     Document Type: Conference Paper

References (23)

1. Watson, J., Beck, J., Howe, A., Whitley, L.: Toward an understanding of local search cost in job-shop scheduling (2001)
2. Iwama, K., Kambayashi, Y., Miyano, E.: New bounds for oblivious mesh routing. In: European Symposium on Algorithms, pp. 295-306 (1998)
3. Zhang, Y., Zha, H., Chao-Hsien, C., Ji, X., Chen, X.: Towards inferring protein interactions: Challenges and solutions. EURASIP Journal on Applied Signal Processing (2005)
4. Li, C.M., Manyà, F., Planes, J.: New inference rules for max-sat. Journal of Artificial Intelligence Research (to appear, 2007)
5. Heras, F., Larrosa, J.: New inference rules for efficient max-sat solving. In: AAAI (2006)
6. Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for max-sat solving. In: ijcai07 (2007)
7. Xing, Z., Zhang, W.: Maxsolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164(1-2), 47-80 (2005)
8. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted csp. In: HCAI, pp. 239-244 (2003)
9. Li, C.M., Manyà, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403-414. Springer, Heidelberg (2005)
10. Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat. In: AAAI, pp. 86-91 (2006)
11. Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and davis-putnam algorithms for maximum satisfiability problems. In: Cliques, Colouring and Satisfiability, pp. 587-615 (1996)
12. Wallace, R.J.: Directed arc consistency preprocessing. In: Constraint Processing, Selected Papers, pp. 121-137. Springer, London, UK (1995)
13. Larrosa, J., Meseguer, P., Schiex, T.: Maintaining reversible dac for max-csp. Artif. Intell. 107(1), 149-163 (1999)
14. de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving max-sat as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 363-376. Springer, Heidelberg (2003)
15. Shen, H., Zhang, H.: Study of lower bounds functions for max-2-sat. In: AAAI 2004, pp. 185-190 (2004)
16. Alsinet, T., Manyà, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 371-377. Springer, Heidelberg (2005)
17. de Givry, S.: Singleton consistency and dominance for weighted csp. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)
18. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted csp. In: UCAI2003 (2003)
19. Xing, Z., Zhang, W.: Maxsolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artif. Intell. 164(1-2), 47-80 (2005)
20. Béjar, R., Manyà, F.: Solving combinatorial problems with regular local search algorithms. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 33-43. Springer, Heidelberg (1999)
21. Béjar, R., Hähnle, R., Manyà, F.: A modular reduction of regular logic to classical logic. In: ISMVL'01, pp. 221-226 (2001)
22. Ansótegui, C., Manyà, F.: Mapping problems with finite-domain variables into problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 1-15. Springer, Heidelberg (2005)
23. Argelich, J., Manyà, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics 12(4-5), 375-392 (2006)