TREEDIAG Algorithm

TREEDIAG is a special model-based diagnosis algorithm for tree-structured diagnosis systems. Diagnoses are computed by descending into the tree, enumerating the input combinations that might be responsible for a given inocrrect observation, and combining the diagnoses for the subtrees generating these inputs into diagnoses of the whole system. TREEDIAG has been proven to be faster than other algorithms for tree-structured systems. This homepage gives access to technical reports and literature related to tree and a Smalltalk implementation using Parc Place Visualworks 2.52.

• Bibliography
• Markus Stumptner and Franz Wotawa, Diagnosing Tree-Structured Systems, Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI95), 1997, Nagoya, Japan. ( PS File or PDF File )

• Source Code
  The source code of the TREEDIAG algorithm can be accessed via the link http://www.dbai.tuwien.ac.at/staff/wotawa/ftp_tree/tree.tar.gz. The use of the algorithm for uncommercial purposes is free of charge. No warranty is given.

For further informations contact Markus Stumptner or Franz Wotawa.