Faster Probabilistic Planning Through More Efficient Stochastic Satisfiability Problem Encodings

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 163-172

  Majercik, Stephen M ^a   Rusczek, Andrew P ^a  

^a BOWDOIN COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORMAL LOGIC; KNOWLEDGE REPRESENTATION; SIGNAL ENCODING; STOCHASTIC SYSTEMS;

ENCODINGS; FINITE HORIZONS; PARALLEL ACTIONS; PLANNING PROBLEM; PROBABILISTIC PLANNING; SATISFIABILITY PROBLEMS; SATISFIABILITY SOLVING; SIMPLE++; STATE OF THE ART; STOCHASTIC SATISFIABILITY;

PROBLEM SOLVING;

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

References (11)

1. Blum, A. L., and Langford, J. C. 1999. Probabilistic planning in the Graphplan framework. In Proceedings of the Fifth European Conference on Planning.
2. Cowell, R. 1999. Introduction to inference for Bayesian networks. In Jordan, M. I., ed., Learning in Graphical Models. The MIT Press. 9-26.
3. Giunchiglia, E.; Kartha, G. N.; and Lifschitz, V. 1997. Representing action: Indeterminacy and ramifications. Artificial Intelligence 95(2):409-438.
4. Kautz, H., and Selman, B. 1998. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning, 181-189. AAAI Press.
5. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96), 374-384.
6. Littman, M. L.; Majercik, S. M.; and Pitassi, T. 2001. Stochastic Boolean satisfiability. Journal of Automated Reasoning 27(3):251-296.
7. Majercik, S. M. 2000. Planning Under Uncertainty via Stochastic Satisfiability. Ph.D. Dissertation, Department of Computer Science, Duke University.
8. 2: Approximate probabilistic planning out of stochastic satisfiability.
9. Onder, N. 1998. Personal communication.
10. Reiter, R. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Academic Press.
11. Schubert, L. 1990. Monotonic solution of the frame problem in the situation calculus; an efficient method for worlds with fully specified actions. In Kyburg, H.; Loui, R.; and Carlson, G., eds., Knowledge Representation and Defeasible Reasoning. Dordrecht: Kluwer Academic Publishers. 23-67.