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. ...
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 ...