DPLL with a trace: From SAT to knowledge compilation

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 156-162

  Huang, Jinbo ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; EMPIRICAL EVALUATIONS; EQUIVALENCE TESTING; KNOWLEDGE COMPILATION; POLYNOMIAL-TIME; PROPOSITIONAL THEORIES; SEARCH ALGORITHMS; UNIFORM FRAMEWORK;

ALGORITHMS; EQUIVALENCE CLASSES;

ARTIFICIAL INTELLIGENCE;

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

References (27)

1. Fadi Aloul, Igor Markov, and Karem Sakallah. Faster SAT and smaller BDDs via common function structure. In International Conference on Computer Aided Design (ICCAD), pages 443-448, 2001.
2. Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Algorithms and complexity results for #SAT and Bayesian inference. In 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 340-351, 2003.
3. Anthony Barrett. From hybrid systems to universal plans via domain compilation. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), pages 44-51, 2004.
4. Roberto Bayardo and Joseph Pehoushek. Counting models using connected components. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI), pages 157-162, 2000.
5. Manuel Blum, Ashok K. Chandra, and Mark N. Wegman. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters, 10(2):80-82, 1980.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
7. Marco Cadoli and Francesco M. Donini. A survey on knowledge compilation. AI Communications, 10:137-150, 1997.
8. Adnan Darwiche and Jinbo Huang. Testing equivalence probabilistically. Technical Report D-123, Computer Science Department, UCLA, 2002.
9. Adnan Darwiche and Pierre Marquis. A knowledge compilation map. Journal of Artificial Intelligence Research, 17:229-264, 2002.
10. Adnan Darwiche. Decomposable negation normal form. Journal of the ACM, 48(4):608-647, 2001.
11. 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.
12. Adnan Darwiche. A compiler for deterministic decomposable negation normal form. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), pages 627-634, 2002.
13. Adnan Darwiche. New advances in compiling CNF into decomposable negation normal form. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 328-332, 2004.
14. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Journal of the ACM, (5)7:394-397, 1962.
15. Rina Dechter and Robert Mateescu. The impact of AND/OR search spaces on constraint satisfaction and counting. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP), pages 731-736, 2004.
16. Rina Dechter and Robert Mateescu. Mixtures of deterministic-probabilistic networks and their AND/OR search spaces. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI), pages 120-129, 2004.
17. J. Gergov and C. Meinel. Efficient analysis and manipulation of OBDDs can be extended to FBDDs. IEEE Transactions on Computers, 43(10):1197-1209, 1994.
18. Holger H. Hoos and Thomas Stützle. SATLIB: An Online Resource for Research on SAT. In I.P.Gent, H.v.Maaren, T.Walsh, editors, SAT 2000, pages 283-292. IOS Press, 2000. SATLIB is available online at www.satlib.org.
19. Jinbo Huang and Adnan Darwiche. Using DPLL for efficient OBDD construction. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 127-136, May 2004.
20. Stephen M. Majercik and Michael L. Littman. Using caching to solve larger probabilistic planning problems. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pages 954-959, 1998.
21. Pierre Marquis. Knowledge compilation using theory prime implicates. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pages 837-843, 1995.
22. Matthew Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference, pages 530-535, 2001.
23. Hector Palacios, Blai Bonet, Adnan Darwiche, and Hector Geffner. Pruning conformant plans by counting models on compiled d-DNNF representations. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS), 2005.
24. Tian Sang, Fahiem Bacchus, Paul Beame, Henry Kautz, and Toniann Pitassi. Combining component caching and clause learning for effective model counting. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 20-28, 2004.
25. Bart Selman and Henry Kautz. Knowledge compilation using horn approximation. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI), pages 904-909, 1991.
26. Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996.
27. Fabio Somenzi. CUDD: CU Decision Diagram Package. Release 2.4.0.