A dynamic approach to MPE and weighted MAX-SAT

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 173-179

  Sang, Tian ^a   Beame, Paul ^a   Kautz, Henry ^b  

^a University of Washington   (United States)

^b University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC APPROACHES; MAX-SAT; MOST PROBABLE EXPLANATION; PROBABILISTIC INFERENCE; WEIGHTED MODELS;

ARTIFICIAL INTELLIGENCE;

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

References (22)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah. PBS: A backtrack search pseudo-boolean solver. In Proc. 5th International Conference on Theory and Applications of Satisfiability Testing, 2002.
2. F. Bacchus, S. Dalmao, and T. Pitassi. Value elimination: Bayesian inference via backtracking search. In Uncertainty in Artificial Intelligence UAI-2003, pages 20-28, 2003.
3. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201-236, 1997. (Pubitemid 127628545)
4. B. Borchers and J. Furman. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT. Journal of Combinatorial Optimization, 2(4):299-306, 1999.
5. F. Brglez and H. Fujiwara. A neutral netlist of 10 combinational benchmark designs and a special translator in fortran. In Proc. ISCAS, 1985.
6. M. Chavira and A. Darwiche. Compiling Bayesian networks with local structures. In Proc. 19th IJCAI, 2005.
7. A. Darwiche. A compiler for deterministic decomposable negation normal form. In Proc. 18th AAAI, 2002.
8. A. Darwiche. New advances in compiling cnf into decomposable negation normal form. In Proc. 16th European Conference on Artificial Intelligence, 2004.
9. S. de Givry, J. Larrosa, P. Meseguer, and T. Schiex. Solving max-sat as weighted csp. In 9th Principles and Practice of Constraint Programming, 2003.
10. S. de Givry, M. Zytnicki, F. Heras, and J. Larrosa. Existential arc consistency: Getting closer to full arc consistency in weighted csps. In Proc. 19th IJCAI, 2005.
11. J. Huang and A. Darwiche. A structure-based variable ordering heuristic for sat. In Proc. 18th IJCAI, 2003.
12. F. V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly, 4:269-282, 1990.
13. C. M. Li, F. Manya, and J. Planes. Exploiting unit propagation to compute lower bounds in branch and bound max-sat solvers. In Proc. 11th Principles and Practice of Constraint Programming, 2005.
14. C. Li, F. Manya, and J. Planes. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. In Proc. 21st AAAI, 2006.
15. R. Marinescu and R. Dechter. And/or branch-and-bound for graphical models. In Proc. 19th IJCAI, 2005.
16. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. 38th Design Automation Conference, 2001.
17. J. Park. Using weighted MAX-SAT engines to solve MPE. In Proc. 18th AAAI, 2002.
18. T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi. Combining component caching and clause learning for effective model counting. In Proc. 7th International Conference on Theory and Applications of Satisfiability Testing, 2004.
19. T. Sang, P. Beame, and H. Kautz. Heuristics for fast exact model counting. In Proc. 8th International Conference on Theory and Applications of Satisfiability Testing, 2005.
20. T. Sang, P. Beame, and H. Kautz. Performing Bayesian inference by weighted model counting. In Proc. 20th AAAI, 2005.
21. A. Smith, A. Veneris, M. Ali, and A. Viglas. Fault diagnosis and logic debugging using boolean satisfiability. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 24, 2005.
22. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In International Conference on Computer Aided Design, 2001.