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

1 Answer

Answer :

c) No further inference

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 : Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

Last Answer : b) Atomic sentences

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 : 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 algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

Description : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. 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 is mainly used for automated reasoning? a) Backward chaining b) Forward chaining c) Logic programming d) Parallel programming

Last Answer : c) Logic programming

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 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 the complete specification of the state of the world? a) Atomic event b) Complex event c) Simple event d) None of the mentioned

Last Answer : a) Atomic event

Description : Which process makes different logical expression looks identical? a) Lifting b) Unification c) Inference process d) None of the mentioned

Last Answer : b) Unification

Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Last Answer : c) Every sentence of first-order logic

Description : Which is also called single inference rule? a) Reference b) Resolution c) Reform d) None of the mentioned

Last Answer : b) Resolution

Description : From which rule does the modus ponens are derived? a) Inference rule b) Module rule c) Both Inference & Module rule d) None of the mentioned

Last Answer : a) Inference rule

Description : Which are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Last Answer : d) all of the mentioned

Description : Which is used to construct the complex sentences? a) Symbols b) Connectives c) Logical connectives

Last Answer : c) Logical connectives

Description : Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned

Last Answer : a) Syntactic distinction

Description : Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned

Last Answer : c) Extension of propositional logic

Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned

Last Answer : a) Identical

Description : 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

Last Answer : b) False

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 : Define backward chaining.

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

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

Description : What is viewed as problem of probabilistic inference? a) Speech recognition b) Speaking c) Hearing d) Utterance

Last Answer : a) Speech recognition

Description : Which of the following strategies would NOT be effective at improving your communication competence? a) Recognize the people, objects, and situations remain stable over time b) Recognize that each ... frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference

Last Answer : a) Recognize the people, objects, and situations remain stable over time

Description : Which is true for Decision theory? a) Decision Theory = Probability theory + utility theory b) Decision Theory = Inference theory + utility theory c) Decision Theory = Uncertainty + utility theory d) Decision Theory = Probability theory + preference

Last Answer : c) Decision Theory = Uncertainty + utility theory

Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Last Answer : d) Occur check

Description : What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Last Answer : c) Generalized Modus Ponens

Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Description : Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen

Last Answer : c) Unification

Description : A) Knowledge base (KB) is consists of set of statements. B) Inference is deriving a new sentence from the KB. Choose the correct option. a) A is true, B is true b) A is false, B is false c) A is true, B is false d) A is false, B is true

Last Answer : a) A is true, B is true

Description : Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

Last Answer : d) First-order definite clauses

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

Description : In default logic, which of the following inference rules of the form is allowed? a) (A : B) / C b) A / (B : C) c) A / B d) A / B : C

Last Answer : a) (A : B) / C

Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Last Answer : C. Core, Support , Boundary

Description : Define a Complete inference procedure

Last Answer : An inference procedure is complete if it can derive all true conditions from a set of premises. 

Description : Define an inference procedure

Last Answer : An inference procedure reports whether or not a sentence is entiled by knowledge base provided a knowledge base and a sentence .An inference procedure i' can be described by the sentences that it can derive. If i ... base, we can write. KB --Alpha is derived from KB or i derives alpha from KB. 

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Description : Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

Last Answer : c) Hybrid

Description : In which of the following situations might a blind search be acceptable? a) real-life situation b) complex game c) small search space d) all of the mentioned

Last Answer : c) small search space

Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

Description : What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Simple & Condition-action rule d) None of the mentioned

Last Answer : b) Condition-action rule

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected