Summary and extensions
We have described statistical procedures for evaluating representations. We now outline heuristic rules for choosing representations (Section 9.1), and review the results of the work on S haper’s top-level control (Section 9.2).
KeywordsSimple Graph Changer Operator Incoming Edge Preferable Representation Transitive Graph
Unable to display preview. Download preview PDF.