Using more reasoning to improve #SAT solving

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 185-190

  Davies, Jessica ^a   Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COST EFFECTIVENESS; LEARNING SYSTEMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

BALANCE CHANGES; PROPOSITIONAL THEORY; SEARCH SPACE;

PROBLEM SOLVING;

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

References (19)

1. Bacchus, F.; Dalmao, S.; and Pitassi, T. 2003. Algorithms and Complexity Results for #SAT and Bayesian Inference. In Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer Science, 340-351.
2. Bacchus, F. 2002. Enhancing Davis Putnam with Extended Binary Clause Reasoning. In Proceedings of the 18th National Conference on Artificial Intelligence, 613-619.
3. Chavira, M., and Darwiche, A. 2005. Compiling Bayesian Networks with Local Structure. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 1306-1312.
4. Chavira, M., and Darwiche, A. 2006. Encoding CNFs to Empower Component Analysis. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, 61-74.
5. Chavira, M.; Darwiche, A.; and Jaeger, M. 2004. Compiling Relational Bayesian Networks for Exact Inference. In Proceedings of the 2nd European Workshop on Probabilistic Graphical Models, 49-56.
6. Darwiche, A. 2002. A Compiler for Deterministic Decomposable Negation Normal Form. In Proceedings of the 18th National Conference on Artificial Intelligence, 627-634.
7. Domshlak, C., and Hoffmann, J. 2006. Fast Probabilistic Planning Through Weighted Model Counting. In Proceedings of the 16th International Conference on Automated Planning and Scheduling, 243-252.
8. Gomes, C.; Sabharwal, A.; and Selman, B. 2006. Model Counting: A New Strategy for Obtaining Good Bounds. In Proceedings of the 21st National Conference on Artificial Intelligence, 54-61.
9. Hoos, H., and Stützle, T. 2000. SATLIB: An Online Resource for Research on SAT. SAT 283-292.
10. Huang, J., and Darwiche, A. 2005. DPLL with a Trace: From SAT to Knowledge Compilation. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 156-162.
11. Kumar, T. K. S. 2002. A Model Counting Characterization of Diagnoses. In Proceedings of the 13th International Workshop on Principles of Diagnosis, 70-76.
12. Li, W.; van Beek, P.; and Poupart, P. 2006. Performing Incremental Bayesian Inference by Dynamic Model Counting. In Proceedings of the 21st National Conference on Artificial Intelligence, 1173-1179.
13. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Conference on Design Automation, 530-535.
14. Sang, T.; Beame, P.; and Kautz, H. 2005a. Heuristics for Fast Exact Model Counting. In Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing, 226-240.
15. Sang, T.; Beame, P.; and Kautz, H. 2005b. Performing Bayesian Inference by Weighted Model Counting. In Proceedings of the 20th National Conference on Artificial Intelligence, 475-482.
16. Sang, T.; Bacchus, E.; Beame, P.; Kautz, H.; and Pitassi, T. 2004. Combining Component Caching and Clause Learning for Effective Model Counting. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, 20-28.
17. SHARCNET. 2007. Shared Hierarchical Academic Research Computing Network, http://www.sharcnet.ca.
18. Thurley, M. 2006. sharpSAT - Counting Models with Advanced Component Caching and Implicit BCPs. In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, 424-429.
19. Valiant, L. G. 1979. The Complexity of Computing the Permanent. Theoretical Computer Science 8:189-201.