Planning with Incomplete Knowledge and Limited Quantification

Tamara Babaian and James G Schmolze

We present a new method for partial order planning in the STRIPS/SNLP style. Our contribution centers on how we drop the closed world assumption while adding a useful class of universally quantified propositions to the representation of states and actions. These quantified expressions allow expression of partially closed worlds, such as "block A has no other block on it", or "F is the only Tex file in directory 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.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.