Now showing items 1-2 of 2
Complexity, Decidability and Undecidability Results for Domain- Independent Planning
In this paper, we examine how the complexity of domain- independent planning with STRIPS-like operators depends on the nature of the planning operators.<P>We show conditions under which planning is decidable and undecidable. ...
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 ...