A compiler for deterministic, decomposable negation normal form

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 627-634

  Darwiche, Adnan ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL CIRCUITS; GRAPH THEORY; POLYNOMIALS;

NEGATION NORMAL FORM (NNF);

PROGRAM COMPILERS;

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

References (16)

1. Aloul, F. A.; Markov, I. L.; and Sakallah, K. A. 2001. Faster SAT and smaller BDDs via common function structure. In International Conference on Computer Aided Design (ICCAD), 443-448.
2. Aloul, F. A.; Markov, I. L.; and Sakallah, K. A. December, 2001. Faster SAT and smaller BDDs via common function structure. Technical Report CSE-TR-445-01, Computer Science and Engineering Division, University of Michigan.
3. Bayardo, R., and Pehoushek, J. 2000. Counting models using connected components. In AAAI, 157-162.
4. Birnbaum, E., and Lozinskii, E. 1999. The good old Davis-Putnam procedure helps counting models. Journal of Artificial Intelligence Research 10:457-477.
5. Blum, M.; Chandra, A. K.; and Wegman, M. N. 1980. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10(2):80-82.
6. Boole, G. 1848. The calculus of logic. The Cambridge and Dublin Mathematical Journal 3:183-198.
7. Bryant, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35:677-691.
8. Darwiche, A., and Hopkins, M. 2001. Using recursive decomposition to construct elimination orders, jointrees and dtrees. In Trends in Artificial Intelligence, Lecture notes in AI, 2143. Springer-Verlag. 180-191.
9. Darwiche, A., and Huang, J. 2002. Testing equivalence probabilistically. Technical Report D-123, Computer Science Department, UCLA, Los Angeles, Ca 90095.
10. Darwiche, A., and Marquis, P. 2001. A perspective on knowledge compilation. In Proc. International Joint Conference on Artificial Intelligence (IJCAI), 175-182.
11. Darwiche, A. 2001a. Decomposable negation normal form. Journal of the ACM 48(4): 1-42.
12. Darwiche, A. 2001b. A logical approach to factoring belief networks. Technical Report D-121, Computer Science Department, UCLA, Los Angeles, Ca 90095. To appear in KR-02.
13. Darwiche, A. 2001c. 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.
14. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. CACM 5:394-397.
15. Gergov, J., and Meinel, C. 1994. Efficient analysis and manipulation of OBDDs can be extended to FBDDs. IEEE Transactions on Computers 43(10): 1197-1209.
16. Jensen, F. V.; Lauritzen, S.; and Olesen, K. 1990. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly 4:269-282.