Characterizing propagation methods for Boolean satisfiability

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

Volumn 4121 LNCS, Issue , 2006, Pages 325-338

  Hsu, Eric I ^a   McIlraith, Sheila A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

EXPECTATION MAXIMIZATION (EM); ITERATIVE ALGORITHMS; SATISFIABILITY PROBLEMS (SAT); STATISTICAL PHYSICS;

BOOLEAN FUNCTIONS;

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

References (24)

1. Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms 27 (2005) 201-226
2. Kask, K., Dechter, R., Gogate, V.: Counting-based look-ahead schemes for constraint satisfaction. In: Proc. of 10th International Conference on Constraint Programming (CP '04), Toronto, Canada. (2004)
3. Wang, Y., Zhang, J., Fossorier, M., Yedidia, J.: Reduced latency iterative decoding of LDPC codes. In: IEEE Conference on Global Telecommunications (GLOBECOM). (2005)
4. Braunstein, A., Zecchina, R.: Learning by message passing in networks of discrete synapses. Physics Review Letters 96(5) (2006)
5. Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo (1988)
6. Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47(2) (2001)
7. Braunstein, A., Zecchina, R.: Survey propagation as local equilibrium equations. Journal of Statistical Mechanics: Theory and Experiments PO6007 (2004)
8. Yedidia, J., Freeman, W., Weiss, Y.: Understanding belief propagation and its generalizations. In Nebel, B., Lakemeyer, G., eds.: Exploring Artificial Intelligence in the New Millennium. Morgan Kaufmann (2003) 239-256
9. Dechter, R., Mateescu, R.: A simple insight into properties of iterative belief propagation. In: Proc. of 19th International Conference on Uncertainty in Artificial Intelligence (UAI '03), Acapulco, Mexico. (2003)
10. Lardeux, F., Saubion, F., Hao, J.K.: Three truth values for the SAT and MAX-SAT problems. In: Proc. of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI '05), Edinburgh, Scotland. (2005)
11. Yedidia, J., Freeman, W., Weiss, Y.: Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory 51(7) (2005) 2282-2312
12. Dechter, R., Kask, K., Mateescu, R.: Iterative join-graph propagation. In: Proc. of 18th International Conference on Uncertainty in Artificial Intelligence (UAI '02), Edmonton, Canada. (2002) 128-136
13. Kask, K., Dechter, R., Larrosa, J., Pfeffer, A.: Cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence 166(1-2) (2005)
14. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1996)
15. Goemans, M.; Williamson, D.: New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7 (1994) 656-666
16. Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (42) (1995) 1115-1145
17. Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: Proc. of 18th International Joint Conference on Artificial Intelligence (IJCAI '03), Acapulco, Mexico. (2003)
18. Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1-2) (2000) 67-100
19. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society 39(1) (1977) 1-39
20. Shang, Y., Wah, B.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 12(1) (1998) 61-99
21. Neal, R., Hinton, G.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In Jordan, M., ed.: Learning in Graphical Models. Kluwer Academic Publishers (1998) 355-368
22. Jordan, M., Ghahramani, Z., Jaakkola, T., Saul, L.: An introduction to variational methods for graphical models. In Jordan, M., ed.: Learning in Graphical Models. MIT Press (1998)
23. Braunstein, A., Leone, M., Mezard, M., Weigt, M., Zecchina, R.: Sp-1.3 survey propagatrion implementation, (http://www.ictp.trieste.it/~zecchina/SP/)
24. Hsu, E., McIlraith, S.: Characterizing loopy belief propagation as expectation maximization (2006) Manuscript in preparation.