Minimal cut-set methodology for artificial intelligence applications

Conference · Sun Jan 01 00:00:00 EST 1984

OSTI ID:6101162

Weisbin, C R; de Saussure, G; Barhen, J; Oblow, E M; White, J C

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.

• Research Organization: Oak Ridge National Lab., TN (USA)
• DOE Contract Number: AC05-84OR21400
• OSTI ID: 6101162
• Report Number(s): CONF-841254-1; ON: DE85004779
• Resource Relation: Conference: 1. conference on artificial intelligence applications, Denver, CO, USA, 5 Dec 1984
• Country of Publication: United States
• Language: English

Related Subjects

42 ENGINEERING
22 GENERAL STUDIES OF NUCLEAR REACTORS
ARTIFICIAL INTELLIGENCE
GATING CIRCUITS
LOGIC CIRCUITS
POWER REACTORS
RISK ASSESSMENT
DECISION TREE ANALYSIS
FAULT TREE ANALYSIS
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
REACTOR SAFETY
ELECTRONIC CIRCUITS
REACTORS
SAFETY
SYSTEM FAILURE ANALYSIS
SYSTEMS ANALYSIS
420800* - Engineering- Electronic Circuits & Devices- (-1989)
220100 - Nuclear Reactor Technology- Theory & Calculation
220900 - Nuclear Reactor Technology- Reactor Safety