Structural relaxations by variable renaming and their compilation for solving MinCostSAT

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

Volumn 4741 LNCS, Issue , 2007, Pages 605-619

  Ramírez, Miquel ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; PROGRAM COMPILERS;

HEURISTIC SEARCH; OFF-THE-SHELF TOOLS; STRUCTURAL SOLUTION;

PROBLEM SOLVING;

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

References (33)

1. Culberson, J.C., Schaeffer, J.: Pattern Databases. Comp. Int. 14 (1998)
2. Korf, R.E.: Finding Optimal Solutions to Rubik's Cube Using Pattern Patabases. In: Proc. AAAI-98 (1998)
3. Bonet, B., Geffner, H.: Planning as Heuristic Search. Art. Int. 129 (2001)
4. Mackworth, A.K.: Consistency in Networks of Relations. Art. Int. 8 (1977)
5. Li, X.Y.: Optimization Algorithms for the Minimum - Cost Satisfiability Problem. PhD thesis, North Carolina State University (2004)
6. Dechter, R.: Constraint Processing. Morgan Kauffman, San Francisco (2003)
7. Darwiche, A.: New Advances in Compiling CNF to Decomposable Negational Normal Form. In: Proc. ECAI'04 (2004)
8. Eén, N., Söressón, N.: MiniSAT: an Extensible SAT Solver. Technical report, Chalmers University (2005)
9. Darwiche, A.: Decomposable Negation Normal Form. Journal of the ACM 48(4), 608-647 (2001)
10. Marquis, P., Darwiche, A.: Compiling Propositional Weighted Bases. Artificial Intelligence 157(1-2), 81-113 (2004)
11. Argelich, J., et al.: First Evaluation of Max-SAT solvers (2006), Available at http ://www.iiia.csic.es/maxsat06
12. Fu, Z., Malik, S.: Solving the Minimum Cost Satisfiability Problem using SAT Based Branch-and-Bound Search. In: Proc. of ICCAD'06 (2006)
13. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaule, G., Fargier, H.: Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints 4(3), 199-240 (2004)
14. Papadimitrou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
15. Giunchiglia, E., Maratea, M.: Solving Optimization Problems with DLL. In: Proc. of ECAI'06 (2006)
16. Larrosa, J., Heras, F.: Resolution in Max-SAT and its Relation to Local Consistency in Weighted CSPs. In: Proc. of IJCAI-05, pp. 193-199 (2005)
17. Larrosa, J., Heras, F.: New Inference Rules for Efficient Max-SAT Solving. In: Proc. AAAI'06 (2006)
18. Li, C.M., Manyá, F., Planes, J.: Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. In: Proc. AAAI'06 (2006)
19. de Givry, S., Larrosa, J., Messeguer, P., Schiex, T.: Solving Max-SAT as Weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 363-376. Springer, Heidelberg (2003)
20. Dechter, R.: Enhancement Schemes for Constraint Processing: Backjumping, Learning and Cutset Decomposition. Artificial Intelligence 43(3), 273-312 (1990)
21. Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3), 579-627 (2002)
22. Bidyuk, B., Dechter, R.: On Finding Minimal w-cutset. In: Proc. UAI-04 (2004)
23. Dechter, R.: Mini-Buckets: a General Scheme for Generating Approximations in Automated Reasoning. In: Proc. of IJCAI-97, pp. 1297-1303 (1997)
24. Dechter, R.: Bucket Elimination: a Unifying Framework for Reasoning. Artificial Intelligence 113(1-2), 41-85 (1999)
25. Darwiche, A., Marquis, P.: A Knowledge Compilation Map. Journal of AI Research 17, 229-264 (2002)
26. Darwiche, A.: Recursive Conditioning. Artificial Intelligence 126(1-2), 5-41 (2001)
27. Coudert, O., Madre, J.C.: New Ideas for Solving Covering Problems. In: Proc. of DAC'95, pp. 641-646 (1995)
28. Moskewicz, M.W., Madigan, C.F., et al.: Chaff: Engineeering an Efficient SAT Solver. In: Proc.of DAC-01 (2001)
29. Zhang, L., Madigan, C.F., et al,: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: Proc. of ICCAD'01 (2001)
30. Silva, J.P.M., Sakallah, K.A.: GRASP - A New Search Algorithm for Satisfiability. In: Proc. of ICCAD'96, pp. 220-227 (1996)
31. Manquinho, V., Marques-Silva, J.: Search Pruning Techniques in SAT-based Branch-and-Bound Algorithms for the Binate Covering Problem. IEEE Trans. on CAD and Integrated Circuit and Systems 21, 505-516 (2002)
32. Alsinet, T., Manya, F., Planes, J.: Improved Exact Solvers for Weighted Max-SAT. In: Proc. of the 8th SAT conference (2005)
33. Choi, A., Chavira, M., Darwiche, A.: Node splitting: A scheme for generating upper bounds in bayesian networks. In: Proceedings UAI-07 (to appear, 2007)