Now showing items 1-2 of 2
Complexity, Decidability and Undecidability Results for Rule- Based Expert Systems
We prove the equivalence of domain-independent planning systems and rule-based expert systems. We use this equivalence to examine how the complexity of deriving conclusions in rule-based expert systems depends on the nature ...
On the Complexity of Blocks-World Planning
In this paper, we show that blocks-world planning is difficult, in the sense that finding an optimal plan is NP-hard. This is true regardless of whether or not, the goal state is completely specified, and regardless of ...