#### DMCA

## Planning with Incomplete Knowledge and Limited Quantification (1998)

### Cached

### Download Links

Citations: | 1 - 0 self |

### Citations

5450 |
Artificial Intelligence: A Modern Approach, 2nd edition ed
- RUSSELL, NORVIG
- 2003
(Show Context)
Citation Context ...er, we investigate a method for dropping the closed world assumption (CWA) in the context of SNLP-style (McAllester & Rosenblitt 1991) partial order planning (e.g., (Penberthy & Weld 1992; Weld 1994; =-=Russell & Norvig 1995-=-)). A common approach when dropping the CWA retains much of the structure of STRIPS-style planners but re-considers the set of propositions associated with each state of the world. Instead of being a ... |

2218 |
Strips: A new approach to the application of theorem proving to problem solving
- Fikes, Nilsson
- 1971
(Show Context)
Citation Context ...ectory D." In addition, we argue informally that the time complexity of our algorithm is no worse than traditional partial order planners that make the closed world assumption. STRIPS-style plann=-=ing (Fikes & Nilsson 1971-=-) is decidable only if we restrict the language to finitely many ground terms (Erol, Nau, & Subrahmanian 1992). STRIPS-style planning becomes NP-complete only when we bound the length of the plan bein... |

1774 | Some philosophical problems from the standpoint of artificial intelligence.
- McCarthy, Hayes
- 1969
(Show Context)
Citation Context ...asier to use ground negated literals in place of quantified /-forms. We base our representation of a changing world on STRIPS (Fikes & Nilsson 1971), which in turn is based on the situation calculus (=-=McCarthy & Hayes 1969-=-). A changing world is thus viewed as a sequence of states, where state transitions occur only as the result of deliberate action taken by the (single) agent. We use oe to represent a substitution and... |

730 | A new method for solving hard satisfiability problems, - Selman, Levesque, et al. - 1992 |

579 | Pushing the envelope: Planning, propositional logic, and stochastic search, in:
- Kautz, Selman
- 1996
(Show Context)
Citation Context ...actable in the general case. However, thanks to recent advances in applying stochastic search to propositional satisfiability problems (SAT) (Selman, Levesque, & Mitchell 1992) and planning problems (=-=Kautz & Selman 1996-=-), much larger classes of NP-complete planning problems can now be solved. Moreover, recent work demonstrates that studying partial order planning (POP) can lead to good encodings of planning problems... |

493 | UCPOP: A sound, complete, partial order planner for ADL
- Penberthy, Weld
- 1992
(Show Context)
Citation Context ...Ginsberg 1996). cally, in this paper, we investigate a method for dropping the closed world assumption (CWA) in the context of SNLP-style (McAllester & Rosenblitt 1991) partial order planning (e.g., (=-=Penberthy & Weld 1992-=-; Weld 1994; Russell & Norvig 1995)). A common approach when dropping the CWA retains much of the structure of STRIPS-style planners but re-considers the set of propositions associated with each state... |

449 | Systematic Nonlinear Planning .
- McAllester, D
- 1991
(Show Context)
Citation Context ...large part, we agree with the strategy proposed by Ginsberg (Ginsberg 1996). cally, in this paper, we investigate a method for dropping the closed world assumption (CWA) in the context of SNLP-style (=-=McAllester & Rosenblitt 1991-=-) partial order planning (e.g., (Penberthy & Weld 1992; Weld 1994; Russell & Norvig 1995)). A common approach when dropping the CWA retains much of the structure of STRIPS-style planners but re-consid... |

239 | Conditional Nonlinear Planning
- Peot, Smith
- 1992
(Show Context)
Citation Context ... of being a complete description of each state, the set of propositions is considered to be a subset. Thus, with each state we have a set of beliefs that are assumed to be true but incomplete (e.g., (=-=Peot & Smith 1992-=-; Etzioni et al. 1992; Krebsbach, Olawsky, & Gini 1992; Russell & Norvig 1995)). 2 The above approach for dropping the CWA is effective but limited in its expressive power if there is no quantificatio... |

220 | An approach to planning with incomplete informationâ€™,
- Etzioni, Hanks, et al.
- 1992
(Show Context)
Citation Context ...e description of each state, the set of propositions is considered to be a subset. Thus, with each state we have a set of beliefs that are assumed to be true but incomplete (e.g., (Peot & Smith 1992; =-=Etzioni et al. 1992-=-; Krebsbach, Olawsky, & Gini 1992; Russell & Norvig 1995)). 2 The above approach for dropping the CWA is effective but limited in its expressive power if there is no quantification. For example, you c... |

173 | Encoding Plans in Propositional Logic. - Kautz, McAllester, et al. - 1996 |

112 | The frame problem and knowledge-producing actions.
- Scherl, Levesque
- 1993
(Show Context)
Citation Context ... (iff) x is currently in directory y and Tex(x) is true iff x is a Tex file. 2 An excellent formal account of this style of representation as applied to planning with sensing actions can be found in (=-=Scherl & Levesque 1997-=-). The quantified expression states that every object is either not in D or is not a Tex file except possibly F and G -- i.e., the quantified expression does not commit to the truth or falsity of :In(... |

88 | Sound and efficient closed-world reasoning for planning - Etzioni, Golden, et al. - 1997 |

50 | Omnipotence Without Omniscience: Efficient Sensor Management for Planning. - Golden, Etzioni, et al. - 1994 |

41 | Complexity results for blocks-world planning
- Gupta, Nau
- 1991
(Show Context)
Citation Context ...able only if we restrict the language to finitely many ground terms (Erol, Nau, & Subrahmanian 1992). STRIPS-style planning becomes NP-complete only when we bound the length of the plan being sought (=-=Gupta & Nau 1991-=-). Thus, planning is intractable in the general case. However, thanks to recent advances in applying stochastic search to propositional satisfiability problems (SAT) (Selman, Levesque, & Mitchell 1992... |

31 | When is Planning Decidable? - Erol, Nau, et al. - 1992 |

31 | An empirical study of sensing and defaulting in planningâ€™, - Krebsbach, Olawsky, et al. - 1992 |

15 | Do Computers Need Common Sense
- Ginsberg
- 1996
(Show Context)
Citation Context ...nternational Conference on Artificial Intelligence Planning Systems (AIPS-98), Pittsburgh, Pennsylvania, USA, June 7, 1998 1 Therefore, in large part, we agree with the strategy proposed by Ginsberg (=-=Ginsberg 1996-=-). cally, in this paper, we investigate a method for dropping the closed world assumption (CWA) in the context of SNLP-style (McAllester & Rosenblitt 1991) partial order planning (e.g., (Penberthy & W... |