Abstract
Decision trees are widely used to specify the conditional logic of software systems. Desirable properties of decision trees, such as syntactic consistency, semantic consistency, completeness, and non-redundancy, are discussed. Tree traversal algorithms and associated data structures for obtaining these properties are described and their practical usefulness is briefly justified. The algorithms can be easily incorporated into existing CASE tools.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
