In a backward chaining system you start with the initial facts, and keep using the rules to draw new

conclusions (or take certain actions) given those facts.

a) True

b) False

1 Answer

Answer :

b) False

Related questions

Description : There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Last Answer : a) True

Description : Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Last Answer : c) Data-driven, goal-driven

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Description : What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Last Answer : b) Substitutes matching the query

Description : Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Last Answer : c) Logic programming

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

Description : Define backward chaining.

Last Answer : This algorithm works backward from the goal, chaining through rules to find known facts that support the proof.

Description : Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False

Last Answer : a) True

Description : An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions

Last Answer : b) contains procedural knowledge

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

Description : Subject orientation A . The science of collecting, organizing, and applying numerical facts B. Measure of the probability that a certain hypothesis is incorrect given certain observations. C. ... specially built around all the existing applications of the operational data D . None of these

Last Answer : C. One of the defining aspects of a data warehouse, which is specially built around all the existing applications of the operational data

Description : Which skill needed by the nurse to think critically involves identification of patient problems indicated by data? a) Analysis Analysis is used to identify patient problems indicated by data. b) ... or interventions used to address patient problems and to help a patient move toward desired outcomes.

Last Answer : a) Analysis Analysis is used to identify patient problems indicated by data.

Description : In the question given below, there are two statements followed by two conclusions. You have to take the given statements to be true even if they seem to be at variance from commonly known facts. Read all the ... queens are kings. (1) Only I follows (2) Only II follows (3) Neither I nor II follows

Last Answer : (3) Neither I nor II follows

Description : What is meant by persistence actions? a) Allow a literal to remain false b) Allow a literal to remain true c) Allow a literal to remain false & true d) None of the mentioned

Last Answer : b) Allow a literal to remain true

Description : A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actions. a) True b) False

Last Answer : a) True

Description : Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same. a) True b) False

Last Answer : b) False

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

Description : An omniscient agent knows the actual outcome of its actions and can act accordingly; but omniscience is impossible in reality. Rational Agent always does the right thing; but Rationality is possible in reality. a) True b) False

Last Answer : a) True

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

Description : A rule-based system consists of a bunch of IF-THEN rules. a) True b) False

Last Answer : a) True

Description : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Last Answer : a) First-order definite clause are similar to propositional forward chaining

Description : Which condition is used to cease the growth of forward chaining? a) Atomic sentences b) Complex sentences c) No further inference d) All of the mentioned

Last Answer : c) No further inference

Description : Reasoning strategies used in expert systems include ............... (A) Forward chaining, backward chaining and problem reduction (B) Forward chaining, backward chaining and boundary ... chaining, backward chaining and back propagation (D) Backward chaining, problem reduction and boundary mutation

Last Answer : (A) Forward chaining, backward chaining and problem reduction

Description : Forward chaining systems are ............. where as backward chaining systems are ................ (A) Data driven, Data driven (B) Goal driven, Data driven (C) Data driven, Goal driven (D) Goal driven, Goal driven

Last Answer : (C) Data driven, Goal driven 

Description : A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0. a) True b) False c) Sometimes – it can also output intermediate values as well d) Can’t say

Last Answer : a) True

Description : Which of the following “laws” is Asimov’s first and most important law of robotics? a) robot actions must never result in damage to the robot b) robots must never take actions harmful to humans c) robots must follow the directions given by humans d) robots must make business a greater profit

Last Answer : b) robots must never take actions harmful to humans

Description : What are not present in start actions? a) Preconditions b) Effect c) Finish d) None of the mentioned

Last Answer : a) Preconditions

Description : The network that involves backward links from output to the input and hidden layers is called _________ a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

Description : A perceptron is a ______________ a) Feed-forward neural network b) Backpropagation algorithm c) Backtracking algorithm d) Feed Forward-backward algorithm

Last Answer : a) Feed-forward neural network

Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned

Last Answer : c) Planning graph algorithm

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Last Answer : a) Feed-forward neural network

Description : The network that involves backward links from output to the input and hidden layers is called as ____. a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Last Answer : a) True

Description : What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Last Answer : d) All of the mentioned

Description : In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the ... ) Either A or B can be true depending upon situation d) Neither A nor B is true

Last Answer : a) A is true

Description : Ability to learn how to do tasks based on the data given for training or initial experience A. Self Organization B. Adaptive Learning C. Fault tolerance D. Robustness

Last Answer : B. Adaptive Learning

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Description : Like semantic networks, frames can be queried using spreading activation. a) True b) False

Last Answer : a) True

Description : Given a stream of text, Named Entity Recognition determines which pronoun maps to which noun. a) False b) True

Last Answer : a) False

Description : In Bayes theorem, what is meant by P(Hi|E)? a) The probability that hypotheses Hi is true given evidence E b) The probability that hypotheses Hi is false given evidence E c) The probability ... Hi is true given false evidence E d) The probability that hypotheses Hi is false given false evidence E

Last Answer : a) The probability that hypotheses Hi is true given evidence E

Description : The main condition which should be followed by research is Options: A) Honest exploration B) Knowledge of facts and principles C) Standardized findings and conclusions D) All the above

Last Answer : D) All the above 

Description : Which AI system not store memories or past experiences for future actions. A. Reactive machine B. Limited memory C. Theory of mind D. None of above

Last Answer : A. Reactive machine 

Description : Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures ... unreliable feedback and with a variety of training examples d) The overall power of the system

Last Answer : a) Ease with which the method can be adapted to different domains of application