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

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
by

1 Answer

Answer :

a) First-order definite clause are similar to propositional forward chaining
by

Related questions

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

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

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

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

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

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

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

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

Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

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

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

Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Description : Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Last Answer : c) Generalized modus ponens

Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

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

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

Last Answer : a) True

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

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

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

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

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

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

Last Answer : c) 3

What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Description : What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Last Answer : b) Separate words into individual morphemes and identify the class of the morphemes

Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

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

What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Description : What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Last Answer : c) Both Objects & Relations

Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Description : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Last Answer : d) All of the mentioned

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

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

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

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

Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Description : Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Last Answer : a) ILP

What can be viewed as a single lateral of disjunction? a) Multiple clause b) Combine clause c) Unit clause d) None of the mentioned

Description : What can be viewed as a single lateral of disjunction? a) Multiple clause b) Combine clause c) Unit clause d) None of the mentioned

Last Answer : c) Unit clause

What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Description : What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Last Answer : c) Extension of propositional logic

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Description : What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Last Answer : a) Reduction to propositional logic, Manipulate rules directly

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

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

Define AND –Elimination rule in propositional logic

Description : Define AND –Elimination rule in propositional logic

Last Answer : AND elimination rule states that from a given conjunction it is possible to inference any of the conjuncts. 

Define Modus Ponen’s rule in Propositional logic?

Description : Define Modus Ponen’s rule in Propositional logic?

Last Answer : The standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal is said to be Modus Ponen’s rule. 

What are the basic Components of propositional logic?

Description : What are the basic Components of propositional logic?

Last Answer : i. Logical Constants (True, False) 

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus 

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level 

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

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

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

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

Define 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.

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

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

A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Last Answer : d) all of the mentioned

Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Description : Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Last Answer : b) Knowledge base

Which of the following is being investigated as a means of automating the creation of a knowledge base? a) automatic knowledge acquisition b) simpler tools c) discovery of new concepts d) all of the mentioned

Description : Which of the following is being investigated as a means of automating the creation of a knowledge base? a) automatic knowledge acquisition b) simpler tools c) discovery of new concepts d) all of the mentioned

Last Answer : d) all of the mentioned

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

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

A Personal Consultant knowledge base contain information in the form of __________ a) parameters b) contexts c) production rules d) all of the mentioned

Description : A Personal Consultant knowledge base contain information in the form of __________ a) parameters b) contexts c) production rules d) all of the mentioned

Last Answer : d) all of the mentioned

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

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

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

A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All

Description : A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All

Last Answer : b) At most one

Among the following which is not a horn clause? a) p b) Øp V q c) p → q d) p → Øq

Description : Among the following which is not a horn clause? a) p b) Øp V q c) p → q d) p → Øq

Last Answer : d) p → Øq

What are the processes of Relative clause.

Description : What are the processes of Relative clause.

Last Answer : i. Generating Good English sentences  ii. Over generation  iii. Under generation

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

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

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

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 

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

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

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Last Answer : a) Planning problem