Encoding CNFs to empower component analysis

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

Volumn 4121 LNCS, Issue , 2006, Pages 61-74

  Chavira, Mark ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUERY LANGUAGES; STATISTICAL METHODS; SYNTACTICS;

KNOWLEDGE COMPILATION; PROBABILISTIC QUERIES; SYNTACTIC COMPONENT ANALYSIS; VARIABLE SPLITTING;

ALGORITHMS;

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

References (18)

1. The cachet model counter, http://www.cs.washington.edn/homes/kautz/ Cachet.
2. ISCAS89 Benchmark Circuits, http://www.cbl.ncsu.edu/www/CBL_Docs/ iscas89.html.
3. The c2d compiler, http://reasoning.cs.ucla.edu/c2d.
4. The Ace compiler, http://reasoning.cs.ucla.edu/ace.
5. Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Dpll with caching: A new algorithm for #SAT and Bayesian inference. Electronic Colloquium on Computational Complexity (ECCC), 10(003), 2003.
6. R. Bayardo and J. Pehoushek. Counting models using connected components. In AAAI, pages 157-162, 2000.
7. Craig Boutilier, Nir Friedman, Moisés Goldszmidt, and Daphne Koller. Context-specific independence in Bayesian networks. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), pages 115-123, 1996.
8. Mark Chavira and Adnan Darwiche. Compiling Bayesian networks with local structure. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 1306-1312, 2005.
9. Mark Chavira, Adnan Darwiche, and Manfred Jaeger. Compiling relational Bayesian networks for exact inference. In Proceedings of the Second European Workshop on Probabilistic Graphical Models (PGM), pages 49-56, 2004.
10. Adnan Darwiche. On the tractability of counting theory models and its application to belief revision and truth maintenance. Journal of Applied Non-Classical Logics, 11(1-2):11-34, 2001.
11. Adnan Darwiche. A compiler for deterministic, decomposable negation normal form. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), pages 627-634, Menlo Park, California, 2002. AAAI Press.
12. Adnan Darwiche. A logical approach to factoring belief networks. In Proceedings of KR, pages 409-420, 2002.
13. Adnan Darwiche. New advances in compiling CNF to decomposable negational normal form. In Proceedings of European Conference on Artificial Intelligence, pages 328-332, 2004.
14. John P. Hayes. Introduction to Digital Logic Design. Addison Wesley, 1993.
15. Jinbo Huang and Adnan Darwiche. Dpll with a trace: From sat to knowledge compilation. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 156-162, 2005.
16. M. M. Mirsalehi and T. K. Gaylord. Logical minimization of multilevel coded functions. Applied Optics, 25:3078-3088, September 1986.
17. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, and Toniann Pitassi. Combining component caching and clause learning for effective model counting. In SAT, 2004.
18. Tian Sang, Paul Beame, and Henry Kautz. Solving Bayesian networks by weighted model counting. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), volume 1, pages 475-482. AAAI Press, 2005.