1.

Rule Based System

Consists of a rule-base (permanent data); an inference engine (process); and a

workspace or working memory (temporary data). Not part of the basic reasoning
process, but essential to applications, is the user interface. In the cognitive models, the
rule-base is usually equated with LTM and the workspace with STM. There will be
restrictions on these to correspond with assumptions about mental architecture: e.g.
limited size of STM.
Knowledge is stored as rules in the rule-base. (Also known as the knowledge
base. Rules are of the form (IF some condition THEN some action). The condition tests
working memory, e.g. for the presence of certain symbols or patterns of symbols. In
many systems, the conditions are expressed logically as conjunctions (occasionally,
disjunctions) of predicates. In some systems, some conditions correspond to sensor data.
In a cognitive model, this would correspond to direct access to sensory input, rather
than to its representation in STM.
The action can be one of the following:
Another symbol or set of symbols to be added to STM. In many systems these will be
expressed logically as conjunctions of predicates. Some other action on STM, e.g.
``delete the symbols XyZ''.
Some other action, e.g. turning a motor off, printing. In a cognitive model, this would
correspond to a motor command. The inference engine applies the rules to working
memory

History:
Expert systems were introduced by the Stanford Heuristic Programming Project led
by Edward Feigenbaum, who is sometimes termed the "father of expert systems"; other
key early contributors were Jairus Lainibo, Bruce Buchanan, and Randall Davis. The
Stanford researchers tried to identify domains where expertise was highly valued and
complex, such as diagnosing infectious diseases (Mycin) and identifying unknown
organic molecules (Dendral). Although that "intelligent systems derive their power
from the knowledge they possess rather than from the specific formalisms and inference
schemes they use" – as Feigenbaum said – seems in retrospect a rather straightforward
insight, it was a significant step forward then, since until then, research had been
focused on attempts to develop very general-purpose problem solvers, such as those
described by Allen Newell and Herb Simon. Expert systems became some of the first
truly successful forms of artificial intelligence (AI) software
In the 1980s, expert systems proliferated. Universities offered expert system courses
and two thirds of the Fortune 500 companies applied the technology in daily business
activities. In 1981, the first IBM PC, with the PC DOS operating system, was
introduced. The imbalance between the high affordability of the relatively powerful
chips in the PC, compared to the much more expensive cost of processing power in the
mainframes that dominated the corporate IT world at the time, created a new type of
architecture for corporate computing, termed the client-server model.

Principles of Rule Based Systems

Rules specify inference steps in a declaractive way. They may express different types
of reasoning:
i. Premise conclusion logical implication
ii. antecedence consequence infer from given precondition
iii. evidence hypothesis interpretation of facts
iv. situation action situated behavior
v. IF THEN informal paraphrases
vi. left-side right-side can mean anything
Well-known successful system include ILOG, JBoss Drools, CLISP, Ruby ROOLS,
NOBRE. Historically: used for XPS (e.g., DEC’s XCon et al.). Nowadays as “Business
Rules”, Semantic Web or in Games

Elements of Rule-Based System

There are some of rule-base system consists of few basic and simple as follows:
1. A set of facts. These facts are actually the assertions and should be anything relevant
to the beginning state of the system.
2. A set of rules. This contain all actions that should be taken within the scope of
aproblem specify how to act on the assertion set. A rule relates the facts in the IF
part to some action in the THEN part. The system should contain only relevant rules
and avoid the irrelevant onces because the number of rules in thesystem will affect
its performance.
3. A termination criterion. This is condition that determine that a solution has been
found or that none exits. This is necessary to terminate some rule-based systems
that find themselves in infinite loops otherwise.
 Example Maintainance For Project
DATA CONDITIONS RULES
Project
IF no Sound<
AND
AUDIO 250 mA was using <Sound,>Sound IF resistor already at loud
as mini Project Loud, Quiet OR
IF battery is okey
Conclusion
THEN there was component
problem

2. Fault Tree (FTA)

Fault tree analysis (FTA) is a top down, deductive failure analysis in which an undesired
state of a system is analyzed using Boolean logic to combine a series of lower-level
events. This analysis method is mainly used in the fields of safety engineering and
reliability engineering to understand how systems can fail, to identify the best ways to
reduce risk or to determine (or get a feeling for) event rates of a safety accident or a
particular system level (functional) failure. FTA is used in the aerospace, nuclear power,
chemical and process, pharmaceutical, petrochemical and other high-hazard industries;
but is also used in fields as diverse as risk factor identification relating to social service
system failure. FTA is also used in software engineering for debugging purposes and is
closely related to cause-elimination technique used to detect bugs
These conditions are classified by the severity of their effects. The most severe
conditions require the most extensive fault tree analysis. These "system Failure
Conditions" and their classification are often previously determined in the functional
Hazard analysis.

History:
Fault Tree Analysis (FTA) was originally developed in 1962 at Bell Laboratories by
H.A. Watson, under a U.S. Air Force Ballistics Systems Division contract to evaluate
the Minuteman I Intercontinental Ballistic Missile (ICBM) Launch Control System.The
use of fault trees has since gained widespread support and is often used as a failure
analysis tool by reliability experts. Following the first published use of FTA in the 1962
Minuteman I Launch Control Safety Study, Boeing and AVCO expanded use of FTA
to the entire Minuteman II system in 1963-1964. FTA received extensive coverage at a
1965 System Safety Symposium in Seattle sponsored by Boeing and the University of
Washington.Boeing began using FTA for civil aircraft design around 1966.
Following process industry disasters such as the 1984 Bhopal disaster and 1988
Piper Alpha explosion, in 1992 the United States Department of Labor Occupational
Safety and Health Administration (OSHA) published in the Federal Register at 57 FR
6356 (1992-02-24) its Process Safety Management (PSM) standard in 19 CFR
1910.119.[26] OSHA PSM recognizes FTA as an acceptable method for process hazard
analysis (PHA). Today FTA is widely used in system safety and reliability engineering,
and in all major fields of engineering.

Principles of Fault Tree

 An undesired event is defined
 The event is resolved into its immediate causes
 This resolution of events continues until basic causes are identified
 A logical diagram called a fault tree is constructed showing the logical event
relationships
Element of Fault Tree (FTA)
 FTA is a deductive analysis approach for resolving an undesired event into its
causes
 FTA is a backward looking analysis, looking backward at the causes of a
given event
 Specific stepwise logic is used in the process
 Specific logic symbols are used to to illustrate the event relationships
 A logic diagram is constructed showing the event relationships.
 Example Maintainance For Project

Audio failure

Audio Jack Speaker Electronic

problem Problem Problem

Problem Change Change Problem Change Problem

undefined audio jack speaker undefined component undefined

Conclusion
In this experiment, students can analyse problem using the Rule Based System and Fault Tree.
Besides that, students can gain their knowledge about how to use a method on the Rule Based
System and Fault Tree. Then, they can know how to define the problem by using the Rule
Based System and Fault to diagnose and maintenance for mini projects.
 Reference

1. http://www.j-paine.org/students/lectures/lect3/node5.html
2. https://en.wikipedia.org/wiki/Expert_system#History
3. http://link.springer.com/chapter/10.1007%2F978-3-642-21004-4_7#page-1
4. http://www.kr.tuwien.ac.at/education/ewbs_slides/rule-based.pdf
5. http://ai-depot.com/Tutorial/RuleBased.html
6. https://www.hq.nasa.gov/office/codeq/risk/docs/ftacourse.pdf
7. https://en.wikipedia.org/wiki/Fault_tree_analysis