Generation of smaller programs for efficient solution of Query-Answering problems

In this paper, an essential structure of the proposed bottom-up solution to the Query-Answering (QA) problem is clarified, and its weak point and the solution are discussed. Then, the knowledge base, the importance of the support set and the generating method are introduced. In addition, because the volume of information (data) from a large-scale QA problem might become massive, probably to a scale that cannot be processed, we propose two solutions, which are the minimization of the used memory and the updating procedure, so as to reduce the data size and minimize the updating procedure. Finally, we have completed experiments to prove that the proposed solutions can efficiently solve the problem mentioned above.