Using weighted MAX-SAT engines to solve MPE

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 682-687

  Park, James D ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILISTIC LOGICS; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS;

MOST PROBABLE EXPLANATION (MPE) PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 0036928389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Bayesian network repository. www.cs.huji.ac.il/labs/compbio/Repository.
2. Darwiche, A. 2001. Recursive conditioning. Artifical Intelligence Journal 125(1-2):5-41.
3. Kask, K., and Dechter, R. 1999. Stochastic local search for Bayesian networks. In Workshop on AI and Statistics 99, 113-122.
4. Littman, M. 1999. Initial experiments in stochastic satisfiability. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, 667-672.
5. Mills, P., and Tsang, E. 2000. Guided local search for solving SAT and weighted MAX-SAT problems. Journal of Automated Reasoning 24:205-233.
6. Rish, I., and Dechter, R. 2000. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning 24(1/2):225-275.
7. Wah, B., and Shang, Y. 1997. Discrete Lagrangian-based search for solving MAX-SAT problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, 378-383.