An intelligent problem solver must be able to decompose a complex problem into simplex parts. A decomposition algorithm would not only be beneficial for traditional subgoal-oriented planning systems but also support distributed, multi-agent planners. In this paper , we present an algorithm for automatic problem decomposition. Given a domain description with… (More)
In this paper, we develop a decision-theoretic planning approach to synthesizing high-quality contract anytime algorithms. Anytime algorithms are considered as time-parameterized probabilistic actions. Given a set of primitive anytime algorithms and their performance prooles, the problem of synthesizing high-quality anytime algorithms is translated to a… (More)
In this paper, we provide a nonmonotonic logic for analogical reasoning and a graphical representation method to facilitate the calculation of analogies .