Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eļ...
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
Due to its important practical applications, temporal planning is of great research interest in artiļ¬cial intelligence. Yet most of the work in this area so far is limited in at...
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...