DC-SSAT: A divide-and-conquer approach to solving stochastic satisfiability problems efficiently

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 416-422

  Majercik, Stephen M ^a   Boots, Byron ^b  

^a BOWDOIN COLLEGE   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING; SET THEORY;

SOLVING STOCHASTIC SATISFIABILITY (SSAT); SPACE CONSTRAINTS; VIABLE PARTIAL ASSIGNMENTS (VPA);

RANDOM PROCESSES;

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

References (10)

1. Bacchus, F.; Dalmao, S.; and Pitassi, T. 2003. Value elimination: Bayesian inference via backtracking search. In UAI-2003, 20-28.
2. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM 5:394-397.
3. Freudenthal, E., and Karamcheti, V. 2003. QTM: Trust management with quantified stochastic attributes. Technical Report TR2003-848, Courant Institute, NYU.
4. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In UAI-99, 279-288.
5. Littman, M. L.; Majercik, S. M.; and Pitassi, T. 2001. Stochastic Boolean satisfiability. Journal of Automated Reasoning 27(3):251-296.
6. Majercik, S. M., and Littman, M. L. 2003. Contingent planning under uncertainty via stochastic satisfiability. Artificial Intelligence 147:119-162.
7. Papadimitriou, C. H. 1985. Games against nature. Journal of Computer Systems Science 31:288-301.
8. Park, T. J., and Van Gelder, A. 1996. Partitioning methods for satisfiability testing on large formulas. In CADE, 748-762.
9. Roth, D. 1996. On the hardness of approximate reasoning. Artificial Intelligence 82(1-2):273-302.
10. Walsh, T. 2001. Search on high degree graphs. In IJCAI-01, 266-274.