Matthew L. Ginsberg
This paper makes two linked contributions. First, we argue that p]anning systems, instead of being correct (every plan returned achieves the goal) and complete (all such plans are returned), should be approximately correct and complete, in that most plans returned achieve the goal and that most such plans are returned. Our first contribution is to formalize this notion. Our second aim is to demonstrate the practical importance of these ideas.