Are complete K-trees something more than decision trees?

Authors:
Gabriel Valiente
Affiliations:
-
Venue:
ACM SIGART Bulletin
Year:
1991

Citing 3
Cited 0

A decision-table-used processor for checking completeness and consistency in rule-based expert systems

International Journal of Man-Machine Studies
Knowledge based systems validation: a state of the art

AI Communications
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

I have just read the research report "Using Complete K-Trees to Generate Code in Pascal for an Expert System" by Dr. Edward N. Schwartz, appeared in SIGART Bulletin 1(2): 12--13. The report first presents K-trees as an "implementation independent method of knowledge representation," useful "in all stages of expert system development." The idea of a complete K-tree is then introduced, in which all possible values of every property are explicitly recorded in the tree. As this is the central result presented in the report, I think it deserves some comments.