SCHEMA: A knowledge edition interface for obtaining program code from structured descriptions of PSMs: Two case studies

The basic conjecture in this paper is that besides the basic libraries of t asks and problem-solving methods (PSMs), it is necessary to develop two com plementary twin libraries. One of them consists of knowledge-acquisition sc hemas, as they are required by PSMs, and the other one contains those PSMs' reduction methods, from the knowledge level to the symbol level. In order to support this conjecture, we first describe the reduction method fundamen tals based on hierarchical graphs representing the underlying computational model. Then we shall comment on the development of the SCHEMA interface; b y using this interface, we can directly obtain the program code, provided t he task knowledge, PSM, and application domain are edited following the kno wledge acquisition schemas by means of structured natural language sentence s. This kind of editing unmistakably and in reversibly establishes the rela tionships with the underlying model. Since the reduction method links the u nderlying model with the program code, the reduction process is completed. Conversely, we can retrieve the underlying model graph and the knowledge-le vel model from the program code because of the reversibility of the reducti on method. In order to make clear the reduction method and SCHEMA interface functioning from the user viewpoint, we shall apply them to a classificati on and diagnose generic task (Hierarchical Classification), which will be d ecomposed by using the "Establish and Define" PSM, and another task to carr y out a plan, which will be decomposed by using the "act-check-decide" PSM. We shall finish this paper with a reflection on the knowledge-level modell ing and the necessity of an increase of the available reduction methods and knowledge acquisition schemas which are included in our SCHEMA interface.