Minimal cut-set methodology for artificial intelligence applications
Charles R. Weisbin, G. de Saussure, J. Barhen, E.M. Oblow, Jeff White · University of North Texas Digital Library (University of North Texas) · 1984
This paper reviews minimal cut-set theory and illustrates its application with an example. The minimal cut-set approach uses disjunctive normal form in Boolean algebra and various Boolean operators to simplify very complicated tree structures composed of AND/OR gates. The simplification process is automated and performed off-line using existing computer codes to implement the Boolean reduction on the finite, but large tree structure. With this approach, on-line expert diagnostic systems whose response time is critical, could determine directly whether a goal is achievable by comparing the actual system state to a concisely stored set of preprocessed critical state elements.