Contingent planning under uncertainty via stochastic satisfiability

[1]  Hector Geffner Planning with Uncertainty and Incomplete Information , 2001, ECSQARU.

[2]  Blai Bonet,et al.  GPT: A Tool for Planning with Uncertainty and Partial Information , 2001, IJCAI 2001.

[3]  Daphne Koller,et al.  Policy Iteration for Factored MDPs , 2000, UAI.

[4]  Zhengzhu Feng,et al.  Dynamic Programming for POMDPs Using a Factored State Representation , 2000, AIPS.

[5]  S. Majercik,et al.  Stochastic Boolean Satissability , 2000 .

[6]  A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7]  John Langford,et al.  Probabilistic Planning in the Graphplan Framework , 1999, ECP.

[8]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[9]  Daphne Koller,et al.  Computing Factored Value Functions for Policies in Structured MDPs , 1999, IJCAI.

[10]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[11]  Stephen M. Majercik Planning Under Uncertainty via Stochastic Statisfiability , 1999, AAAI/IAAI.

[12]  Subbarao Kambhampati,et al.  On the utility of Plan-space (Causal) Encodings , 1999, AAAI/IAAI.

[13]  Anne Condon,et al.  On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.

[14]  Martha E. Pollack,et al.  Conditional, Probabilistic Planning: A Unifying Algorithm and Effective Search Control Mechanisms , 1999, AAAI/IAAI.

[15]  Craig Boutilier,et al.  Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..

[16]  Jim Blythe,et al.  Decision-Theoretic Planning , 1999, AI Mag..

[17]  S. Majercik,et al.  C-MAXPLAN: Contingent Planning in the MAXPLAN Framework , 1999 .

[18]  M. Littman,et al.  The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..

[19]  Bart Selman,et al.  The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework , 1998, AIPS.

[20]  Michael L. Littman,et al.  MAXPLAN: A New Approach to Probabilistic Planning , 1998, AIPS.

[21]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[22]  Michael L. Littman,et al.  Using Caching to Solve Larger Probabilistic Planning Problems , 1998, AAAI/IAAI.

[23]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[24]  Stephen F. Smith,et al.  Proceedings: The Fourth International Conference on Artificial Intelligence Planning Systems , 1998 .

[25]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[26]  Henry A. Kautz,et al.  BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .

[27]  Ross D. Shachter,et al.  Decision-theoretic planning , 1998 .

[28]  Martha E. Pollack,et al.  Contingency Selection in Plan Generation , 1997, ECP.

[29]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[30]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[31]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[32]  Michael L. Littman,et al.  Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.

[33]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[34]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[35]  Michael L. Littman,et al.  Probabilistic Propositional Planning: Representations and Complexity , 1997, AAAI/IAAI.

[36]  Henry Kautz,et al.  Exploiting Variable Dependency in Local Search , 1997, IJCAI 1997.

[37]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[38]  Craig Boutilier,et al.  Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations , 1996, AAAI/IAAI, Vol. 2.

[39]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[40]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[41]  Craig Boutilier,et al.  Approximate Value Trees in Structured Dynamic Programming , 1996, ICML.

[42]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[43]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[44]  Craig Boutilier,et al.  Exploiting Structure in Policy Construction , 1995, IJCAI.

[45]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[46]  Andrew G. Barto,et al.  Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..

[47]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[48]  Daniel S. Weld,et al.  Probabilistic Planning with Information Gathering and Contingent Execution , 1994, AIPS.

[49]  Robert P. Goldman,et al.  Conditional Linear Planning , 1994, AIPS.

[50]  Robert P. Goldman,et al.  Representing Uncertainty in Simple Planners , 1994, KR.

[51]  Drew McDermott,et al.  Modeling a Dynamic and Uncertain World I: Symbolic and Probabilistic Reasoning About Change , 1994, Artif. Intell..

[52]  James A. Hendler,et al.  Readings in Planning , 1994 .

[53]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[54]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[55]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[56]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[57]  Henry E. Kyburg,et al.  Knowledge Representation and Defeasible Reasoning , 1990 .

[58]  Lenhart K. Schubert Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

[59]  V. Rich Personal communication , 1989, Nature.

[60]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[61]  Bruce W. Ballard,et al.  The *-Minimax Search Procedure for Trees Containing Chance Nodes , 1983, Artif. Intell..

[62]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[63]  M. Puterman,et al.  Modified Policy Iteration Algorithms for Discounted Markov Decision Problems , 1978 .

[64]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[65]  David H. D. Warren,et al.  Generating Conditional Plans and Programs , 1976, AISB.

[66]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[67]  R. Bellman Dynamic Programming , 1957, Science.

[68]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[69]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[70]  R. Howard Dynamic Programming and Markov Processes , 1960 .

[71]  M. Littman,et al.  Stochastic Boolean Satis ability , 2022 .