Using Complete K-Trees to Generate Code in Pascal for an Expert System E d w a r d N. Schwartz, P h . D . D e p a r t m e n t of M a t h e m a t i c s a n d C o m p u t e r S c i e n c e Manhattanville College 125 P u r c h a s e S t r e e t P u r c h a s e , N e w York 10577 For the past several years, my colleagues and I have been doing work with expert systems and the representation of the knowledge in those systems. We have previously reported on the effectiveness of K-trees, an implementation independent method of knowledge representation, in all of the stages of expert system development. We use K-trees for obtaining and recording heuristics, ordering rules, translating rules into an expert system using a shell, and for documenting the system. ~ Briefly, a K-tree is an n-ary tree that has the eonsequents of rules as its leaves and the antecedents of these rules as its nodes. A n
/lp/association-for-computing-machinery/using-complete-k-trees-to-generate-code-in-pascal-for-an-expert-system-UPDC0hNE6K