Which algorithm will work backward from the goal to solve knowledge representation problem?

View Discussion

Improve Article

Save Article

  • Read
  • Discuss
  • View Discussion

    Improve Article

    Save Article

    Forward Chaining and Backward Chaining are the two most important strategies in the field of Artificial Intelligence and lie in the Expert System Domain of AI.
    Forward and Backward chaining is the strategies used by the Inference Engine in making the deductions.

    Inference Engine:
    Inference Engine is a component of the expert system that applies logical rules to the knowledge base to deduce new information. It interprets and evaluates the facts in the knowledge base in order to provide an answer.
    A knowledgebase is a structured collection of facts about the system’s domain.

    Forward Chaining:
    Forward Chaining the Inference Engine goes through all the facts, conditions and derivations before deducing the outcome i.e When based on available data a decision is taken then the process is called as Forwarding chaining, It works from an initial state and reaches to the goal(final decision).

    Example:
    A
    A -> B
    B
    —————————–
    He is running.
    If he is running, he sweats.
    He is sweating.

    Backward Chaining:
    In this, the inference system knows the final decision or goal, this system starts from the goal and works backwards to determine what facts must be asserted so that the goal can be achieved, i.e it works from goal(final decision) and reaches the initial state.

    Example:
    B
    A -> B
    A
    —————————–
    He is sweating.
    If he is running, he sweats.
    He is running.

    Difference between Forwarding Chaining and Backward Chaining:

    Forward ChainingBackward Chaining
    1. When based on available data a decision is taken then the process is called as Forward chaining. Backward chaining starts from the goal and works backward to determine what facts must be asserted so that the goal can be achieved.
    2. Forward chaining is known as data-driven technique because we reaches to the goal using the available data. Backward chaining is known as goal-driven technique because we start from the goal and reaches the initial state in order to extract the facts.
    3. It is a bottom-up approach. It is a top-down approach.
    4. It applies the Breadth-First Strategy. It applies the Depth-First Strategy.
    5. Its goal is to get the conclusion. Its goal is to get the possible facts or the required data.
    6. Slow as it has to use all the rules. Fast as it has to use only a few rules.
    7. It operates in forward direction i.e it works from initial state to final decision. It operates in backward direction i.e it works from goal to reach initial state.
    8. Forward chaining is used for the planning, monitoring, control, and interpretation application. It is used in automated inference engines, theorem proofs, proof assistants and other artificial intelligence applications.

    My Personal Notes arrow_drop_up

    1. Which algorithm will work backward from the goal to solve a problem?a) Forward chaining

    b) Backward chainingc) Hill-climb algorithmd) None of the mentionedView AnswerAnswer: bExplanation: Backward chaining algorithm will work backward from the goal andit will chain the known facts that support the proof.2. Which is mainly used for automated reasoning?a) Backward chainingb) Forward chainingc) Logic programmingd) Parallel programmingView AnswerAnswer: cExplanation: Logic programming is mainly used to check the working process ofthe system.3. What will backward chaining algorithm will return?a) Additional statementsb) Substitutes matching the queryc) Logical statementd) All of the mentionedView AnswerAnswer: bExplanation: It will contains the list of goals containing a single element andreturns the set of all substitutions satisfying the query.4. How can be the goal is thought of in backward chaining algorithm?a) Queueb) Listc) Vectord) StackView AnswerAnswer: dExplanation: The goals can be thought of as stack and if all of them us satisfiedmeans, then current branch of proof succeeds.

    5. What are used in backward chaining algorithm?a) Conjunctsb) Substitutionc) Composition of substitutiond) None of the mentionedView AnswerAnswer: cExplanation: None6. Which algorithm are in more similar to backward chaining algorithm?a) Depth-first search algorithmb) Breadth-first search algorithmc) Hill-climbing search algorithmd) All of the mentionedView AnswerAnswer: aExplanation: It is depth-first search algorithm because its space requirements arelinear in the size of the proof.7. Which problem can frequently occur in backward chaining algorithm?a) Repeated statesb) Incompletenessc) Complexityd) Both Repeated states & IncompletenessView AnswerAnswer: dExplanation: If there is any loop in the chain means, It will lead to incompletenessand repeated states.8. How the logic programming can be constructed?a) Variablesb) Expressing knowledge in a formal languagec) Graphd) All of the mentionedView Answer

    Answer: bExplanation: Logic programming can be constructed by expressing knowledge in aformal expression and the problem can be solved by running inference process.9. What form of negation does the prolog allows?a) Negation as failureb) Propositionc) Substitutiond) Negation as successView AnswerAnswer: aExplanation: None

    Upload your study docs or become a

    Course Hero member to access this document

    Upload your study docs or become a

    Course Hero member to access this document

    End of preview. Want to read all 90 pages?

    Upload your study docs or become a

    Course Hero member to access this document

    Which is used in backward chaining algorithm?

    A backward chaining algorithm is employed in inference engines, game theories, and complex database systems. The modus ponens inference rule is used as the basis for the backward chaining process.

    Why backward chaining algorithms are called goal oriented?

    Backward chaining is known as goal-driven technique because we start from the goal and reaches the initial state in order to extract the facts.

    What is forward and backward chaining in PEGA?

    Backward chaining means C will be calculated if that is being used in some activity or sections or referenced somewhere i.e. called backward chaining and forward chaining means C will be calculated no matter whether C is used or not.

    What is an example of backward chaining?

    Use backward chaining (i.e., breaking a skill down into smaller steps, then teaching and reinforcing the last step in the sequence first, then the second to the last step, and so on). For example, have the child wash his/her hands in the sink near the toilet.