Now showing items 1-2 of 2
Complexity Results for HTN Planning
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network decomposition, but until now, there has been very little analytical work on the properties of HTN planners. ...
WFS + Branch and Bound = Stable Models
Through the semantics of non-monotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the ...