Recursive Formula for Sub-Problem Generation

Formula for Sequential Sub-Problem Generation

A user wants a language model to write a comprehensive travel guide for Paris. To manage this complex task, they first prompt the model to create a list of key sections to cover, such as 'Famous Landmarks,' 'Local Cuisine,' and 'Transportation Tips.' This process of breaking down the main task into a set of smaller, structured parts can be represented by the formula {p_1, ..., p_n} = G(p_0). In this scenario, what does the function G represent?

Decomposition of a Planning Task

Explaining the Problem Decomposition Formula