CREATOR 

 
Main Page

Architecture 

Case Representation 

Memory Structure 

Problem Elaboration 

Case Retrieval

Problem Elaboration
 
Design specifications are often ill-defined or incomplete. This is particularly common in creative design. The process of problem elaboration tries to create a full description of the design requirements. Defining the design problem takes place in two phases. The first step is done by the designer, and the second one is performed by the system.

In CREATOR the first step comprises the definition by the designer of the HLFs and FSs in the new problem. She/he makes use of the graphical editor which shows the relevant part of the memory structure for the elaboration process. The memory structure presented to the user is a hierarchy of HLFs and LF nodes, with the difference that it does not show cases and connections between them.

The user can perform several operations on the nodes and each type of node has associated a set of available operations. HLF classes can be expanded (e.g. subclasses and/or instances are displayed), collapsed (e.g. subclasses and instances are hidden), and new HLF instances can be linked to a class.

HLF instances can be expanded (e.g. LF nodes are displayed), collapsed (e.g. LF nodes are hidden), new LF nodes can be linked to it, and it can be added to the new problem specification.
LFs can be added to the new problem specification, and can have its contents modified. When a user selects a LF node the lfs_comp link and HLF instance associated to it are automatically added to the new problem specification. The problem specification phase results into a set of HLF instances, LF nodes, and lfs_comp links. At the beginning, the graphical editor shows only the root node.

After the problem has been specified by the user, the system checks the problem description trying to determine if the problem is incomplete. If the problem is incomplete then the system uses an algorithm to complete the initial specifications. The algorithm uses cases to complete the problem.